DBScholar

Back to papers

Effective and Efficient Dynamic Graph Coloring

Summary: Incrementally maintains dynamic-graph colorings while matching the quality of strong static large-graph colorers. A color-propagation algorithm, color index, and pruning rules restrict updates to a small neighborhood, improving efficiency. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
11935
Venue
VLDB
Year
2018
Pagerank
6.0859157e-05
Overall Rank
5,797 | 60.23%
DOI
10.14778/3157794.3157802

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{yuan_vldb18,
        title = {{Effective and Efficient Dynamic Graph Coloring}},
        author = {Yuan, Long and Qin, Lu and Lin, Xuemin and Chang, Lijun and Zhang, Wenjie},
        journal = {PVLDB},
        series = {{VLDB} '18},
        volume = {11},
        number = {3},
        pages = {338--351},
        doi = {10.14778/3157794.3157802},
        url = {https://doi.org/10.14778/3157794.3157802},
        year = {2018}
}

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
189 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026114928
3,962 Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach 2015 SIGMOD 6.9865803e-05
4,474 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.6803983e-05
Previous Page 1 / 1 Next

Semantically Similar Papers