Fetching the paper…
Reading the bibliography…
Let \phi(G) be the minimum conductance of an undirected graph G, and let 0=\lambda_1 <= \lambda_2 <=...
J. Cheeger. A lower bound for the smallest eigenvalue of the Laplacian
1970
Earlier work this paper cites.
N. Alon, V. Milman. λ 1 \lambda_{1} , isoperimetric inequalities for graphs, and superconcentrators
1985
Earlier work this paper cites.
S. Jimbo and A. Maruoka. Expanders obtained from affine transformations
1985
Earlier work this paper cites.
N. Alon. Eigenvalues and expanders
1986
Earlier work this paper cites.
R. Boppana. Eigenvalues and graph bisection: An average-case analysis
1987
Earlier work this paper cites.
A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains
1989
Earlier work this paper cites.
K. Fujiwara. Eigenvalues of Laplacians on a closed Riemannian manifold and its nets
1995
Earlier work this paper cites.
M.X. Goemans, D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
1995
Earlier work this paper cites.
F. R. K. Chung. Laplacians of graphs and Cheeger’s inequalities
1996
Earlier work this paper cites.
Fan R. K. Chung. Spectral graph theory
1997
Earlier work this paper cites.
D.B. Shmoys. Approximation algorithms for cut problems and their applications to divide-and-conquer
1997
Earlier work this paper cites.
N. Alon, M. Krivelevich, B. Sudakov. Finding a large hidden clique in a random graph
1998
Earlier work this paper cites.
S. Guattery, G.L. Miller. On the quality of spectral separators
1998
Earlier work this paper cites.
F.T. Leighton, S. Rao. Multicommodity max-flow min-cut theorem and their use in designing approximation algorithms
1999
Earlier work this paper cites.
J. Shi, J. Malik. Normalized cuts and image segmentation
2000
Earlier work this paper cites.
Y. Azar, A. Fiat, A.R. Karlin, F. McSherry, J. Saia. Spectral analysis of data
2001
Earlier work this paper cites.
U. Feige, J. Kilian. Heristics for semirandom graph problems
2001
Earlier work this paper cites.
F. McSherry. Spectral partitioning of random graphs
2001
Cited alongside, same era.
A. Ng, M. Jordan, Y. Weiss. On spectral clustering: Analysis and an algorithm
2001
Cited alongside, same era.
U. Feige, R. Krauthgamer. A polylogarithmic approximation of the minimum bisection
2002
Cited alongside, same era.
S. Arora, S. Rao, U. Vazirani. Expander flows, geometric embeddings and graph partitioning
2004
Cited alongside, same era.
M. Jerrum, A. Sinclair, and E. Vigoda. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
2004
Cited alongside, same era.
R. Kannan, S. Vempala, A. Vetta. On cluterings: good, bad, and spectral
2004
Cited alongside, same era.
Y. Bilu, N. Linial. Are stable instances easy
2010
Later among the works it cites.
P. Biswal, J.R. Lee, S. Rao. Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
2010
Later among the works it cites.
J. Leskovec, K.J. Lang, M.W. Mahoney. Empirical comparison of algorithms for network community detection
2010
Later among the works it cites.
U. von Luxburg. Clustering stability: an overview
2010
Later among the works it cites.
D. Steurer. On the complexity of unique games and graph expansion
2010
Later among the works it cites.
J. Kelner, J.R. Lee, G. Price, S.-H. Teng. Metric uniformization and spectral bounds for graphs
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Horry, N. Linial, A. Wigderson. Expander graphs and their applications
2006
Cited alongside, same era.
J. Kelner. Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
2006
Cited alongside, same era.
2006
Cited alongside, same era.
U. von Luxburg. A tutorial on spectral clustering
2007
Cited alongside, same era.
D.A. Spielman, S.-H. Teng. Spectral partitioning works: Planar graphs and finite element mashes
2007
Cited alongside, same era.
Harald Räcke. Optimal hierarchical decompositions for congestion minimization in networks
2008
Cited alongside, same era.
Y. Bilu, A. Daniely, N. Linial, M. Saks. On the practically interesting instances of MAXCUT
2012
Later among the works it cites.
A. Daniely, N. Linial, M. Saks. Clustering is difficult only when it does not matter
2012
Later among the works it cites.
V. Guruswami, A.K. Sinop. Faster SDP hierarchy solvers for local rounding algorithms
2012
Later among the works it cites.
J. R. Lee. Gabber-galil analysis of margulis expanders. http://tcsmath.wordpress.com/2012/04/18/gabber-galil-analysis-of-margulis-expanders/
2012
Later among the works it cites.
J.R. Lee, S. Oveis Gharan, L. Trevisan. Multi-way spectral partitioning and higher-order Cheeger inequalities
2012
Later among the works it cites.
A. Louis, P. Raghavendra, P. Tetali, S. Vempala. Many sparse cuts via higher eigenvalues
2012
Later among the works it cites.
K. Makarychev, Y. Makarychev, A. Vijayaraghavan. Approximation algorithms for semi-random graph partitioning problems
2012
Later among the works it cites.
R. O’Donnell, D. Witmer. Improved small-set expansion from higher eigenvalues
2012
Later among the works it cites.
S. Oveis Gharan, L. Trevisan. Approximating the expansion profile and almost optimal local graph clustering
2012
Later among the works it cites.
M. Tanaka. Higher eigenvalues and partitions of graphs
2012
Later among the works it cites.