Database Paper Browser

Back to papers

Parallel Colorful h-star Core Maintenance in Dynamic Graphs

Summary: Introduces highly-parallel local algorithms for colorful h-star core decomposition using a novel colorful h-star n-order H-index to avoid sequential peeling. Adds three optimizations and dynamic maintenance with lower/upper bounds to skip unaffected nodes, yielding ~10× faster convergence and ~1000× speedups on large real-world graphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13100
Venue
VLDB
Year
2023
Pagerank
4.2405999e-05
Overall Rank
9,951 | 30.78%
DOI
10.14778/3603581.3603593

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

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