Research2026-05-14
Rethinking Efficient Graph Coarsening via a Non-Selfishness Principle
Source: Arxiv CS.AI
arXiv:2605.13021v1 Announce Type: cross Abstract: Graph coarsening is a graph dimensionality reduction technique that aims to construct a smaller and more tractable graph while preserving the essential structural and semantic properties of the original graph. However, most existing methods rely on...
arxivpapers