Max Cut for Random Graphs with a Planted Partition
From MaRDI portal
Publication:4670352
DOI10.1017/S0963548304006303zbMath1102.68089MaRDI QIDQ4670352
Béla Bollobás, Alexander D. Scott
Publication date: 18 April 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
05C80: Random graphs (graph-theoretic aspects)
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
