scientific article
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2012.266zbMath1245.68147MaRDI QIDQ2904768
Richard Peng, Alex Levin, Ioannis Koutis
Publication date: 23 August 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for sparse matrices (65F50) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time, Spectral sparsification in the semi-streaming setting, Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions, Engineering a combinatorial Laplacian solver: lessons learned, Measuring edge importance: a quantitative analysis of the stochastic shielding approximation for random processes on graphs, Partitioning Well-Clustered Graphs: Spectral Clustering Works!, Reducing Parallel Communication in Algebraic Multigrid through Sparsification, A General Framework for Graph Sparsification, Unnamed Item
