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)
Incoming Non-self Citations Over Time
Authors
- 1. Long Yuan
- 2. Lu Qin
- 3. Xuemin Lin
- 4. Lijun Chang
- 5. Wenjie Zhang
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,547 | Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees | 2020 | VLDB | 8.5683079e-05 |
| 4,270 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD | 6.3067205e-05 |
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 7,444 | Efficient Label-Constrained Shortest Path Queries on Road Networks: A Tree Decomposition Approach | 2022 | VLDB | 4.7281454e-05 |
| 7,675 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB | 4.6817479e-05 |
| 9,951 | Parallel Colorful h-star Core Maintenance in Dynamic Graphs | 2023 | VLDB | 4.2405999e-05 |
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 |
|---|---|---|---|---|
| 283 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029041257 |
| 3,642 | Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach | 2015 | SIGMOD | 6.8876257e-05 |
| 4,211 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.3563454e-05 |
Previous
Page 1 / 1
Next