DBScholar

Back to papers

Inference-friendly Graph Compression for Graph Neural Networks

Summary: Introduces inference-friendly graph compression, defining GNN-specific inference equivalence to merge indistinguishable nodes. SPGC, configurable (α,r)-compression, and anchored compression enable direct or low-cost inference with quality/efficiency guarantees. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
14141
Venue
VLDB
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,913 | 25.13%
DOI
10.14778/3746405.3746438

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{fan_vldb25,
        title = {{Inference-friendly Graph Compression for Graph Neural Networks}},
        author = {Fan, Yangxin and Che, Haolai and Wu, Yinghui},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {9},
        pages = {3203--3215},
        doi = {10.14778/3746405.3746438},
        url = {https://doi.org/10.14778/3746405.3746438},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers