An Adaptive Spectral Heuristic for Partitioning Random Graphs

DOI10.1007/11786986_60zbMath1223.05296OpenAlexW14204056MaRDI QIDQ3613801

Amin Coja-Oghlan

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_60

zbMATH Keywords

spectral algorithmgraph partition problemrandom input graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Separating populations with wide data: a spectral analysis ⋮ A Spectral Method for MAX2SAT in the Planted Solution Model

This page was built for publication: An Adaptive Spectral Heuristic for Partitioning Random Graphs