Algorithms, graph theory, and the solution of Laplacian linear equations

DOI10.1007/978-3-642-31585-5_5MaRDI QIDQ3166995zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Algorithms, graph theory, and linear equations in Laplacian matrices
• Lx = b
• An empirical comparison of graph Laplacian solvers
• The Laplacian paradigm: emerging algorithms for massive graphs
• Duality and nonlinear graph Laplacians

Cited in

(11)

• Engineering a combinatorial Laplacian solver: lessons learned
• A new approach to Laplacian solvers and flow problems
• An empirical comparison of graph Laplacian solvers
• Polynomial-time algorithms for submodular Laplacian systems
• Transition from Tracy-Widom to Gaussian fluctuations of extremal eigenvalues of sparse Erdős-Rényi graphs
• Iteratively reweighted least squares and slime mold dynamics: connection and convergence
• Lx = b
• Algorithms, graph theory, and linear equations in Laplacian matrices
• Probabilistic logarithmic-space algorithms for Laplacian solvers
• The Laplacian paradigm: emerging algorithms for massive graphs
• Motifs for processes on networks

This page was built for publication: Algorithms, graph theory, and the solution of Laplacian linear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166995)