Algorithms , Graph Theory , and Linear Equations in Laplacian Matrices

@inproceedings{Spielman2010AlgorithmsG,
  title={Algorithms , Graph Theory , and Linear Equations in Laplacian Matrices},
  author={Daniel A. Spielman},
  year={2010}
}
The Laplacian matrices of graphs are fundamental. In addition to facilitating the application of linear algebra to graph theory, they arise in many practical problems. In this talk we survey recent progress on the design of provably fast algorithms for solving linear equations in the Laplacian matrices of graphs. These algorithms motivate and rely upon fascinating primitives in graph theory, including low-stretch spanning trees, graph sparsifiers, ultra-sparsifiers, and local graph clustering… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 105 citations. REVIEW CITATIONS
71 Extracted Citations
66 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 71 extracted citations

106 Citations

01020'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 106 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…