Graph reduction with spectral and cut guarantees
From MaRDI portal
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A \((2 + \epsilon)\)-approximation for maximum weight matching in the semi-streaming model
- A cascadic multigrid algorithm for computing the Fiedler vector of graph Laplacians
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Fast Multi-Scale Method for Drawing Large Graphs
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- A Multiscale Pyramid Transform for Graph Signals
- A study of graph spectra for comparing graphs and trees
- A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs
- Advanced coarsening schemes for graph partitioning
- Algebraic distance on graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- An Interlacing Result on Normalized Laplacians
- Approaching optimality for solving SDD linear systems
- Approximating spectral clustering via sampling: a review
- Efficient algorithms for finding maximum matching in graphs
- Eigenvalues and expanders
- Fast multiscale clustering and manifold identification
- Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
- Graph spanners
- Graph sparsification by effective resistances
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 2080097 (Why is no real title available?)
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Inequalities for the trace of matrix product
- Kron Reduction of Graphs With Applications to Electrical Networks
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Random sampling in cut, flow, and network design problems
- Random sampling of bandlimited signals on graphs
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Relaxation-based coarsening and multiscale graph organization
- Spectral sparsification of graphs
- The Rotation of Eigenvectors by a Perturbation. III
- Vertex sparsification and oblivious reductions
Cited in
(5)- Graph coarsening: from scientific computing to machine learning
- Approximating spectral clustering via sampling: a review
- Perfect reconstruction two-channel filter banks on arbitrary graphs
- Spectrum Consistent Coarsening Approximates Edge Weights
- Pasco (parallel structured coarsening): an overlay to speed up graph clustering algorithms
This page was built for publication: Graph reduction with spectral and cut guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214203)
