AI RESEARCH
Scalable Topology-Preserving Graph Coarsening: Concepts and Algorithms
arXiv CS.LG
•
ArXi:2601.22943v2 Announce Type: replace Graph coarsening reduces the size of a graph while preserving certain properties. Most existing methods preserve either spectral or spatial characteristics. Recent research shows that topology-preserving coarsening methods maintain GNN performance on coarsened graphs but suffer from exponential time complexity. To address these problems, we propose Scalable Topology-Preserving Graph Coarsening (STPGC) by