Database Paper Browser

Back to papers

Parallel Algorithms for Hierarchical Nucleus Decomposition

Summary: Scalable parallel algorithms for nucleus decomposition; produce a dense subgraph hierarchy with interleaved coreness and a concurrent union-find. Parallel approximation with low span, bounded work, and speedups to 60x, with 1.3x coreness error. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6841
Venue
SIGMOD
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,947 | 23.85%
DOI
10.1145/3639287

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