DBScholar

Back to papers

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

Summary: Recasts (k,h)-core decomposition via pairwise h-attainability and an n-order H-index, replacing sequential peeling with a parallelizable local algorithm. Extends it to dynamic maintenance, achieving 10–1000× faster decomposition and 10–100× lower update costs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12528
Venue
VLDB
Year
2021
Pagerank
6.1174514e-05
Overall Rank
5,697 | 60.92%
DOI
10.14778/3461535.3461542

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{liu_vldb21,
        title = {{Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs}},
        author = {Liu, Qing and Zhu, Xuliang and Huang, Xin and Xu, Jianliang},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {9},
        pages = {1531--1543},
        doi = {10.14778/3461535.3461542},
        url = {https://doi.org/10.14778/3461535.3461542},
        year = {2021}
}

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