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)
Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
Clustering heterogeneous financial networks ⋮ Graph Partitioning via Adaptive Spectral Techniques ⋮ Sparse graphs: Metrics and random models ⋮ Unnamed Item
This page was built for publication: Max Cut for Random Graphs with a Planted Partition
