Database Paper Browser

Back to papers

Parallel k-Core Decomposition: Theory and Practice

Summary: A simple, work-efficient parallel framework for k-core decomposition enabling high parallelism. It uses sampling to reduce contention on high-degree vertices, vertical granularity control to cut scheduling overhead for low-degree vertices, and a hierarchical bucket structure for high coreness, yielding strong gains over ParK/PKC/Julienne on 96-core graphs (up to 315x vs ParK). (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7251
Venue
SIGMOD
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,495 | 26.99%
DOI
10.1145/3725332

Incoming Non-self Citations Over Time

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

Authors

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 6 of 6 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