The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
Author:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 2-14
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Finding sparse cuts locally using evolving sets2009
- Nearly Tight Low Stretch Spanning Trees2008
- Robust PageRank and locally computable spam detection features2008
- A combinatorial, primal-dual approach to semidefinite programs2007
- Local Computation of PageRank Contributions2007
- Local Graph Partitioning using PageRank Vectors2006
- 0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time2004
- Expander flows, geometric embeddings and graph partitioning2004
- A Graph-Theoretic Game and Its Application to the k-Server ProblemSIAM Journal on Computing, 1995
- Spectral partitioning1995