Algebraic Distance on Graphs

DOI10.1137/090775087zbMath1235.05042OpenAlexW1999170091MaRDI QIDQ3116501

Ilya Safro, Jie Chen

Publication date: 23 February 2012

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4dda236c57d9807d811384ffa714196c4999949d

zbMATH Keywords

combinatorial scientific computinggraph connectivity measurestationary iterative process

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (12)

Graph coarsening: from scientific computing to machine learning ⋮ Unnamed Item ⋮ Semi-Lipschitz functions and machine learning for discrete dynamical systems on graphs ⋮ Local search for constrained graph clustering in biological networks ⋮ The ultrametric Gromov-Wasserstein distance ⋮ A multilevel bilinear programming algorithm for the vertex separator problem ⋮ Multiscale approach for the network compression-friendly ordering ⋮ Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning ⋮ Advanced Coarsening Schemes for Graph Partitioning ⋮ Unnamed Item ⋮ Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning ⋮ Tree-Based Coarsening and Partitioning of Complex Networks

Uses Software

• SNAP
• SparseMatrix

This page was built for publication: Algebraic Distance on Graphs