Gromov-Wasserstein Graph Coarsening
arXiv:2511.08733v1 Announce Type: new Abstract: We study the problem of graph coarsening within the Gromov-Wasserstein geometry. Specifically, we propose two algorithms that leverage a novel representation of the distortion induced by merging pairs of nodes. The first method, termed Greedy…
