Variational Perspective on Local Graph Clustering

In: Problems in Analysis, Papers dedicated to Salomon Bochner, pp. 195–199. Princeton University Press (1969)

Cheeger, J.: A lower bound for the smallest eigenvalue of the Laplacian · 1969

Earlier work this paper cites.

Management Science 17

Hall, K.M.: An r-dimensional quadratic placement algorithm · 1970

Earlier work this paper cites.

Foundations of Computer Science, 1988., 29th Annual Symposium on pp. 422–431 (1988)

Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms · 1988

Earlier work this paper cites.

SIAM Journal on Matrix Analysis and Applications 11

Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs · 1990

Earlier work this paper cites.

Tech. rep., Stanford InfoLab (1999)

Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web · 1999

Earlier work this paper cites.

Proceedings of the 13th International Conference on World Wide Web pp. 309–318 (2004)

Eiron, N., McCurley, K.S., Tomlin, J.A.: Ranking the web frontier · 2004

Earlier work this paper cites.

FOCS ’06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science pp. 475–486 (2006)

Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors · 2006

Earlier work this paper cites.

SIAM Journal on Scientific Computing 27

Grady, L., Schwartz, E.L.: Isoperimetric partitioning:a new algorithm for graph partitioning · 2006

Earlier work this paper cites.

Linear Algebra and its Applications 423

Chung, F.: Random walks and local cuts in graphs · 2007

Earlier work this paper cites.

SODA ’08 Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms pp. 651–660 (2008)

Andersen, R., Lang, K.: An algorithm for improving graph partitions · 2008

Cited alongside, same era.

Journal of the ACM 56

Arora, S., Rao, S., Vazirani, U.: Expander flows, geometric embeddings and graph partitioning · 2009

Cited alongside, same era.

SIAM J. Imaging Sciences pp. 183–202 (2009)

Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding algorithm for linear inverse problems · 2009

Cited alongside, same era.

Advances in Neural Information Processing Systems 24 (NIPS 2011) (2011)

Dhillon, I.S., Ravikumar, P.K., Tewari, A.: Nearest neighbor based greedy coordinate descent · 2011

Cited alongside, same era.

Internet of Mathematics 6

Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters · 2011

Cited alongside, same era.

Journal of Machine Learning Research 13

SIAM Journal on Scientific Computing 42

Spielman, D.A., Teng, S.H.: A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning · 2013

Later among the works it cites.

In: Proceedings of the 31st International Conference on Machine Learning, pp. 1018–1025 (2014)

Gleich, D.F., Mahoney, M.W.: Anti-differentiating approximation algorithms: A case study with min-cuts, spectral, and flow · 2014

Later among the works it cites.

Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining pp. 1386–1395 (2014)

Kloster, K., Gleich, D.F.: Heat kernel based community detection · 2014

Later among the works it cites.

SODA ’14 Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 1267–1286 (2014)

Orecchia, L., Zhu, Z.A.: Flow-based algorithms for local graph clustering · 2014

Later among the works it cites.

SIAM Review 57

Gleich, D.F.: Pagerank beyond the web · 2015

Later among the works it cites.