Relaxation-Based Coarsening and Multiscale Graph Organization

DOI10.1137/100791142zbMath1219.68125arXiv1004.1220OpenAlexW1866618235MaRDI QIDQ3009313

Ilya Safro, Dorit Ron, Achi Brandt

Publication date: 24 June 2011

Published in: Multiscale Modeling & Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1004.1220

zbMATH Keywords

partitioningalgebraic distancegraph linear orderingmultiscale and multilevel methods for graphsrelaxation-based coarsening

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Graph coarsening: from scientific computing to machine learning ⋮ Unnamed Item ⋮ Optimizing Network Topology for Cascade Resilience ⋮ Local search for constrained graph clustering in biological networks ⋮ Perfect reconstruction two-channel filter banks on arbitrary graphs ⋮ ELRUNA ⋮ Spectrum Consistent Coarsening Approximates Edge Weights ⋮ 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 ⋮ Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations ⋮ Unnamed Item ⋮ Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning ⋮ Gaussian Belief Propagation Solvers for Nonsymmetric Systems of Linear Equations

Uses Software

• METIS
• SparseMatrix
• Bubble-FOS/C
• DibaP