scientific article; zbMATH DE number 5485569
From MaRDI portal
zbMath1231.68184MaRDI QIDQ5302080
Nikhil Srivastava, Daniel A. Spielman
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness, Spectral sparsification in the semi-streaming setting, Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts, The resistance perturbation distance: a metric for the analysis of dynamic networks, Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1., Cover times, blanket times, and majorizing measures, Commute times of random walks on trees, Drawing Big Graphs Using Spectral Sparsification, Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph, Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs, Ranking and Sparsifying a Connection Graph, On graph parameters guaranteeing fast sandpile diffusion, Electric routing and concurrent flow cutting, Diffuse scattering on graphs, Toward a spectral theory of cellular sheaves, Toward Quantifying Vertex Similarity in Networks, Random Walks, Electric Networks and The Transience Class problem of Sandpiles, Estimating Leverage Scores via Rank Revealing Methods and Randomization, Unnamed Item, Sobolev extension by linear operators, Tree-Based Coarsening and Partitioning of Complex Networks
