Dynamic Graph Coloring
Dynamic Graph Coloring is a dynamic graph algorithmic problem that extends classical graph coloring by requiring the maintenance of a proper vertex coloring under a sequence of edge insertions, edge deletions, or vertex updates, ensuring adjacent vertices remain differently colored while minimizing recoloring efforts or color count over time.
29
Publications
824
Citations
78
Authors
43
Institutions
Publications per year
2017–2026
11
Parents
29
Upper Bounds of Dynamic Chromatic Number.
Hong‐Jian Lai, Bruce Montgomery, Hoifung Poon · 2003 · 88 citations
Effective and efficient dynamic graph coloring
Long Yuan, Lu Qin, Xuemin Lin et al. · Proceedings of the VLDB Endowment · 2017 · 58 citations
On the dynamic coloring of graphs
Meysam Alishahi · Discrete Applied Mathematics · 2010 · 53 citations
1–5 of 29
78
5
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 78
43
Universitas Jember
Jember, Indonesia
5 h-index
19 publications
292 citations
Airlangga University
Surabaya, Indonesia
2 h-index
4 publications
47 citations

Sharif University of Technology
Tehran, Iran
2 h-index
6 publications
306 citations

University of British Columbia
Vancouver, Canada
2 h-index
4 publications
80 citations

Lawrence Livermore National Laboratory
Livermore, United States
2 h-index
10 publications
200 citations

Konkuk University
Seoul, South Korea
2 h-index
2 publications
70 citations
Tokyo Institute of Technology
Tokyo, Japan
2 h-index
2 publications
40 citations

University of Alabama at Birmingham
Birmingham, United States
2 h-index
2 publications
40 citations
1–8 of 43
6 publications · 307 citations
6
h-index
2 publications · 32 citations
2
h-index
2 publications · 47 citations
2
h-index
Repository · 1 publications · 15 citations
1
h-index
Conference · 1 publications · 19 citations
1
h-index
1–5