Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations

DOI10.1007/978-3-642-31585-5_5zbMath1367.68337OpenAlexW130125281MaRDI QIDQ3166995

Daniel A. Spielman

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_5

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs ⋮ Motifs for Processes on Networks

This page was built for publication: Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations