pdfformat: 

@InProceedings{cojaoghlan_et_al:LIPIcs:2015:5331, author = {Amin CojaOghlan and Oliver Cooley and Mihyun Kang and Kathrin Skubch}, title = {{The Minimum Bisection in the Planted Bisection Model}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {710725}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897897}, ISSN = {18688969}, year = {2015}, volume = {40}, editor = {Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5331}, URN = {urn:nbn:de:0030drops53315}, doi = {10.4230/LIPIcs.APPROXRANDOM.2015.710}, annote = {Keywords: Random graphs, minimum bisection, planted bisection, belief propagation.} }
Keywords:  Random graphs, minimum bisection, planted bisection, belief propagation.  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)  
Issue date:  2015  
Date of publication:  2015 