Experimental Analysis of Algorithms for the Dynamic Graph Coloring Problem
This paper focuses on the dynamic graph coloring problem, a dynamic variant based on the well-researched graph coloring problem. This variant of the problem not only considers the number of colors used in the coloring for a graph, but also how many nodes in this graph need to change their color when...
Saved in:
| Published in: | Journal of graph algorithms and applications Vol. 28; no. 1; pp. 313 - 349 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
22.08.2024
|
| ISSN: | 1526-1719, 1526-1719 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!