Database Paper Browser

Back to papers

Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs

Summary: Introduces a parallelizable local algorithm for distance-generalized (k,h)-core decomposition, with pairwise h-attainability index and n-order H-index to exploit locality. Also extends to dynamic maintenance, achieving 1–3× faster decomposition and 1–2× lower maintenance costs on real-world graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12340
Venue
VLDB
Year
2021
Pagerank
5.1903263e-05
Overall Rank
6,141 | 57.28%
DOI
10.14778/3461535.3461542

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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