Database Paper Browser

Back to papers

Effective and Efficient Dynamic Graph Coloring

Summary: Incremental dynamic graph coloring preserves high-quality colorings near best static solutions on large graphs. Uses 2-hop color-propagation around update-related vertices, with a color index to bound exploration and pruning rules to reduce propagation. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
11748
Venue
VLDB
Year
2018
Pagerank
5.3358197e-05
Overall Rank
5,764 | 59.95%
DOI
10.14778/3157794.3157802

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
284 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00029014359
3,646 Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach 2015 SIGMOD 6.880993e-05
4,207 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.3519481e-05
Previous Page 1 / 1 Next

Semantically Similar Papers