A spectral heuristic for bisecting random graphs
From MaRDI portal
Publication:3419599
DOI10.1002/rsa.20116zbMath1111.05088MaRDI QIDQ3419599
Publication date: 7 February 2007
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20116
05C80: Random graphs (graph-theoretic aspects)
Related Items
On the Complexity of Random Satisfiability Problems with Planted Solutions, Sparse graphs: Metrics and random models, On the Laplacian Eigenvalues of Gn,p, Top eigenpair statistics for weighted sparse graphs, Repetition-free longest common subsequence of random sequences, Message passing algorithms for MLS-3LIN problem, Finding most likely solutions, Maximum cliques in graphs with small intersection number and random intersection graphs, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Entrywise eigenvector analysis of random matrices with low expected rank
Cites Work