scientific article; zbMATH DE number 7164716
From MaRDI portal
Publication:5214203
zbMath1434.68366arXiv1808.10650MaRDI QIDQ5214203
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1808.10650
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Graph coarsening: from scientific computing to machine learning, Perfect reconstruction two-channel filter banks on arbitrary graphs, Spectrum Consistent Coarsening Approximates Edge Weights, Approximating Spectral Clustering via Sampling: A Review
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A study of graph spectra for comparing graphs and trees
- Eigenvalues and expanders
- Random sampling of bandlimited signals on graphs
- Fast multiscale clustering and manifold identification
- Random Sampling in Cut, Flow, and Network Design Problems
- Advanced Coarsening Schemes for Graph Partitioning
- Relaxation-Based Coarsening and Multiscale Graph Organization
- Spectral Sparsification of Graphs
- Algebraic Distance on Graphs
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- A Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
- Approximating Spectral Clustering via Sampling: A Review
- Efficient algorithms for finding maximum matching in graphs
- Graph spanners
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Inequalities for the trace of matrix product
- A Fast Multi-Scale Method for Drawing Large Graphs
- A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model
- A Time-Vertex Signal Processing Framework: Scalable Processing and Meaningful Representations for Time-Series on Graphs
- A Multiscale Pyramid Transform for Graph Signals
- An Interlacing Result on Normalized Laplacians
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Kron Reduction of Graphs With Applications to Electrical Networks
- Vertex Sparsification and Oblivious Reductions
- Multi-way spectral partitioning and higher-order cheeger inequalities
- Approaching Optimality for Solving SDD Linear Systems
- The Rotation of Eigenvectors by a Perturbation. III
- Graph Sparsification by Effective Resistances
