Documents
Authors
Tables
Log in
Sign up
MetaCart
DMCA
Donate
Documents:
Advanced Search
Include Citations
Authors:
Advanced Search
Include Citations |
Disambiguate
Tables:
DMCA
Spectral Partitioning of Random Graphs (2001)
Cached
Download Links
[www.cs.washington.edu]
Other Repositories/Bibliography
DBLP
Save to List
Add to Collection
Correct Errors
Monitor Changes
by Frank McSherry
Citations:
165 - 3 self
Summary
Citations
Active Bibliography
Co-citation
Clustered Documents
Version History
Citations
332
On Clusterings: Good, Bad and Spectral.
- Kannan, Vempala, et al. - 2004
201
Spectral partitioning works: planar graphs and finite element meshes.
- Spielman, S - 1996
165
Fast computation of low-rank matrix approximations.
- Achlioptas, Mcsherry - 2007
141
Graph bisection algorithms with good average case behavior.
- Bui, Chaudhuri, et al. - 1987
131
Finding a large hidden clique in a random graph. Random Structures and Algorithms,
- Alon, Krivelevich, et al. - 1999
110
Eigenvalues and Graph Bisection: An Average-Case Analysis.
- Boppana - 1987
94
Algorithms for graph partitioning on the planted partition model,”
- Condon, Karp - 2001
85
The probabilistic analysis of some combinatorial search algorithms
- Karp - 1976
84
On the Concentration of Eigenvalues of Random Symmetric Matrices.
- Alon, Krivelevich, et al. - 2002
72
Almost all k-colorable graphs are eaSy to color
- Turner - 1988
56
Coloring random and semi-random k-colorable graphs.
- Blum, Spencer - 1995
51
The eigenvalues of random symmetric matrices, Combinatorica 1
- Füredi, Komlós - 1981
46
Expected complexity of graph partitioning problems.
- Kucera - 1995
40
Simulated annealing for graph bisection.
- Jerrum, Sorkin - 1993
30
Hisao Tamaki, Prabhakar Raghavan, and Santosh Vempala. Latent semantic indexing: A probabilistic analysis
- Papadimitriou - 1998
22
and Nabil Kahale. A spectral technique for coloring random 3-colorable graphs
- Alon - 1997
15
Fast solution of some random NP-hard problems.
- Dyer, Frieze - 1986
13
Heuristics for finding large independent sets, with applications to coloring semi-random graphs.
- Feige, Kilian - 1998
9
Data mining through spectral analysis
- Azar, Fiat, et al. - 2001
7
Expected behavior of graph colouring algorithms
- Kucera - 1977
5
The rotation of eigenvectors by a perturbation 3
- Davis, Kahan - 1970