The Laplacian Paradigm: Emerging Algorithms for Massive Graphs

DOI10.1007/978-3-642-13562-0_2zbMath1284.05312OpenAlexW1558308955MaRDI QIDQ3569060

Shang-Hua Teng

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_2

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving ⋮ Randomized numerical linear algebra: Foundations and algorithms ⋮ Iteratively reweighted least squares and slime mold dynamics: connection and convergence ⋮ Unnamed Item ⋮ Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Hardness Results for Structured Linear Systems ⋮ Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs

This page was built for publication: The Laplacian Paradigm: Emerging Algorithms for Massive Graphs