Nearly linear time algorithms for graph par-titioning

@inproceedings{Spielman2004NearlyLT,
  title={Nearly linear time algorithms for graph par-titioning},
  author={Daniel A. Spielman and Shang-Hua Teng},
  year={2004}
}

Citations

Publications citing this paper.
SHOWING 1-10 OF 104 CITATIONS

Twice-ramanujan sparsifiers

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS

Distributed Computation of Sparse Cuts via Random Walks

VIEW 19 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

From nonlinear embedding to graph distances: A spectral perspective.

VIEW 9 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Overlapping Communities in Social Networks

VIEW 7 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Random walks in distributed networks and their applications

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Extensions and limits to vertex sparsification

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2005
2019

CITATION STATISTICS

  • 25 Highly Influenced Citations