Spectral sparsification of graphs
From MaRDI portal
Recommendations
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Twice-Ramanujan sparsifiers
- Graph sparsification by effective resistances
- An SDP-based algorithm for linear-sized spectral sparsification
- Faster spectral sparsification and numerical algorithms for SDD matrices
Cited in
(only showing first 100 items - show all)- The resistance perturbation distance: a metric for the analysis of dynamic networks
- The weighted barycenter drawing recognition problem
- Sparse topologies with small spectrum size
- A spectral approach to the shortest path problem
- Nonlinear network dynamics with consensus-dissensus bifurcation
- A distributed algorithm for spectral sparsification of graphs with applications to data clustering
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement
- Electrical flows over spanning trees
- Graph coarsening: from scientific computing to machine learning
- A generalized Lieb's theorem and its applications to spectrum estimates for a sum of random matrices
- Stein's method for stationary distributions of Markov chains and application to Ising models
- Toward a spectral theory of cellular sheaves
- Better streaming algorithms for the maximum coverage problem
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
- Nodal domain count for the generalized graph \(p\)-Laplacian
- Faster cut sparsification of weighted graphs
- Spectral sparsification via random spanners
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
- A matrix hyperbolic cosine algorithm and applications
- Subgraph sparsification and nearly optimal ultrasparsifiers
- Improved spectral sparsification and numerical algorithms for SDD matrices
- Minimum fill-in of sparse graphs: kernelization and approximation
- Spectral sparsification and regret minimization beyond matrix multiplicative updates
- Rumor spreading with no dependence on conductance
- Single pass spectral sparsification in dynamic streams
- Vertex sparsification in trees
- Algorithms, graph theory, and linear equations in Laplacian matrices
- Graphs, vectors, and matrices
- Approximating spectral clustering via sampling: a review
- Spectral sparsification in the semi-streaming setting
- scientific article; zbMATH DE number 1189239 (Why is no real title available?)
- Sparsity. Graphs, structures, and algorithms
- Constructing linear-sized spectral sparsification in almost-linear time
- Network essence: PageRank completion and centrality-conforming Markov chains
- An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification
- Drawing Big Graphs Using Spectral Sparsification
- An adaptive fast solver for a general class of positive definite matrices via energy decomposition
- Twice-Ramanujan sparsifiers
- Sparse sums of positive semidefinite matrices
- A unified framework for structured graph learning via spectral constraints
- An SDP-based algorithm for linear-sized spectral sparsification
- Ranking and sparsifying a connection graph
- Graph Clustering using Effective Resistance
- Probabilistic logarithmic-space algorithms for Laplacian solvers
- Copositivity and sparsity relations using spectral properties
- scientific article; zbMATH DE number 7626762 (Why is no real title available?)
- Bounds on the spectral sparsification of symmetric and off-diagonal nonnegative real matrices
- Shape simplification through graph sparsification
- Hamiltonian sparsification and gap-simulation
- Sparsification of Binary CSPs
- A Spectral Approach to Network Design
- Derandomization beyond connectivity: undirected Laplacian systems in nearly logarithmic space
- Improved guarantees for vertex sparsification in planar graphs
- The power of vertex sparsifiers in dynamic graph algorithms
- Determinant-preserving sparsification of SDDM matrices
- Deterministic approximation of random walks in small space
- Twice-Ramanujan sparsifiers
- Twice-Ramanujan sparsifiers
- Refined vertex sparsifiers of planar graphs
- Improved guarantees for vertex sparsification in planar graphs
- Graph reduction with spectral and cut guarantees
- Sparsification of binary CSPs
- A general framework for graph sparsification
- Spectral sparsification of hypergraphs
- Short cycles via low-diameter decompositions
- Expander decomposition and pruning: faster, stronger, and simpler
- Sparsification of two-variable valued constraint satisfaction problems
- Towards an SDP-based approach to spectral methods: a nearly-linear-time algorithm for graph partitioning and decomposition
- Mixing in high-dimensional expanders
- Fast C-K-R partitions of sparse graphs
- A general framework for graph sparsification
- Partitioning well-clustered graphs: spectral clustering works!
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Graph sparsification by effective resistances
- Communication-efficient distributed graph clustering and sparsification under duplication models
- A combinatorial cut-toggling algorithm for solving Laplacian linear systems
- Comparison of matrix norm sparsification
- Better hardness results for the minimum spanning tree congestion problem
- Prediction models with graph kernel regularization for network data
- Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
- Interactions of computational complexity theory and mathematics
- Solving Graph Laplacians via Multilevel Sparsifiers
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- New seeding strategies for the influence maximization problem
- A conjecture on spectral sparsification with respect to hyperbolicity cones
- Better hardness results for the minimum spanning tree congestion problem
- Randomness efficient noise stability and generalized small bias sets
- Solving sparse linear systems faster than matrix multiplication
- Better sparsifiers for directed Eulerian graphs
- Almost-tight bounds on preserving cuts in classes of submodular hypergraphs
- Cut sparsification and succinct representation of submodular hypergraphs
- On the streaming complexity of expander decomposition
- Pasco (parallel structured coarsening): an overlay to speed up graph clustering algorithms
- Are there graphs whose shortest path structure requires large edge weights?
- Connectivity-faithful graph drawing
- Improving surrogate model robustness to perturbations for dynamical systems through machine learning and data assimilation
- Sparse factor analysis for categorical data with the group-sparse generalized singular value decomposition
- Vertex sparsifiers for hyperedge connectivity
This page was built for publication: Spectral sparsification of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096091)
