DBScholar

Back to papers

Distributed D-core Decomposition over Large Directed Graphs

Summary: Introduces anchored coreness and skyline coreness to recast directed (k,l)-core decomposition as distributed H-index/D-index computation. Implements vertex- and block-centric algorithms with complexity guarantees, scaling to billion-edge graphs while reducing runtime and communication. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12848
Venue
VLDB
Year
2022
Pagerank
7.0712144e-05
Overall Rank
3,855 | 73.56%
DOI
10.14778/3529337.3529340

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{liao_vldb22,
        title = {{Distributed D-core Decomposition over Large Directed Graphs}},
        author = {Liao, Xuankun and Liu, Qing and Jiang, Jiaxin and Huang, Xin and Xu, Jianliang and Choi, Byron},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {8},
        pages = {1546--1558},
        doi = {10.14778/3529337.3529340},
        url = {https://doi.org/10.14778/3529337.3529340},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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