Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle

ArXi:2605.13021v1 Announce Type: cross Graph coarsening is a graph dimensionality reduction technique that aims to construct a smaller and tractable graph while preserving the essential structural and semantic properties of the original graph. However, most existing methods rely on pair-wise similarity matching, where each node independently searches for its best partner based on global information. This selfishness matching paradigm incurs substantial computational and memory overhead.