Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach
Summary: Introduces Graph Elementary Collapse (GEC), extending algebraic-topology elementary collapses to coarsen graphs while preserving homotopy equivalence—and thus connectivity, rings, and voids—rather than cuts or spectra. Scalable optimizations support effective GNN tasks. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yuchen Meng (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology; Key Laboratory of Intelligent Supply Chain Technology)
- 3. Longlong Lin (Southwest University)
- 4. Xunkai Li (Beijing Institute of Technology)
- 5. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@article{meng_vldb24,
title = {{Topology-preserving Graph Coarsening: An Elementary Collapse-based Approach}},
author = {Meng, Yuchen and Li, Rong-Hua and Lin, Longlong and Li, Xunkai and Wang, Guoren},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {13},
pages = {4760--4772},
doi = {10.14778/3704965.3704981},
url = {https://doi.org/10.14778/3704965.3704981},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,201 | Balancing Global and Local: Representative Sampling for Large-Scale Vector Data | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,156 | QTCS: Efficient Query-Centered Temporal Community Search | 2024 | VLDB | 5.9560993e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,149 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 2 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 3 | 8,632 | gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs | 2023 | VLDB |
| 4 | 5,415 | Making Graphs Compact by Lossless Contraction | 2021 | SIGMOD |
| 5 | 10,862 | GraphSparseNet: a Novel Method for Large Scale Traffic Flow Prediction | 2025 | VLDB |
| 6 | 9,072 | Time-Topology Analysis | 2021 | VLDB |
| 7 | 11,344 | Neighborhood-Preserving Graph Sparsification | 2024 | VLDB |
| 8 | 1,163 | Local Graph Sparsification for Scalable Clustering | 2011 | SIGMOD |
| 9 | 10,913 | Inference-friendly Graph Compression for Graph Neural Networks | 2025 | VLDB |
| 10 | 8,187 | Demystifying Graph Sparsification Algorithms in Graph Properties Preservation | 2024 | VLDB |