@inproceedings{245202963d6e45ff89532f66b1563352,
title = "The minimum bisection in the planted bisection model",
abstract = "In the planted bisection model a random graph G(n,p_+,p_-) with n vertices is created by partitioning the vertices randomly into two classes of equal size (up to plus or minus 1). Any two vertices that belong to the same class are linked by an edge with probability p_+ and any two that belong to different classes with probability (p_-) c * sqrt((d_+)ln(d_+)) for a certain constant c>0. ",
author = "A. Coja-Oghlan and O. Cooley and M. Kang and K. Skubch",
year = "2015",
doi = "10.4230/LIPIcs.APPROX-RANDOM.2015.710",
language = "English",
isbn = "978-3-939897-89-7",
series = "Leibniz International Proceedings in Informatics ",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "710--725",
booktitle = "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)",
address = "Germany",
}