B Prakash, Wei Jin, Shengbo Gong, Juntong Ni, Wenqi Fan, Mohammad Hashemi
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Many real-world datasets can be naturally represented as graphs, spanning a wide range of domains. However, the increasing complexity and size of graph datasets present significant challenges for analysis and computation. In response, graph reduction, or graph summarization, has gained prominence for simplifying large graphs while preserving essential properties. In this survey, we provide a comprehensive understanding of graph reduction methods, including graph sparsification, graph coarsening, and graph condensation. Specifically, we establish a unified definition for these methods and introduce a hierarchical taxonomy to categorize the associated challenges. Our survey then systematically reviews the technical details of these methods and emphasizes their practical applications across diverse scenarios. Further, we outline critical research directions to ensure the continued effectiveness of graph reduction techniques.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.03358")
get_code_for_paper("2402.03358")
have("2402.03358")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.03358.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.03358)
Connect an agent — have() is free.