A dynamically turbo-charged heuristic for graph coloring. (c2018)
We launch a study on the dynamic form of the graph coloring problem proving it to be fixed-parameter tractable with respect to the edit-parameter. This leads us to present a new turbo-charged heuristic for the problem that works by merging standard heuristic tools like Greedy coloring with the turbo...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/10466 https://doi.org/10.26756/th.2019.114 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|