| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6874140 | Information Processing Letters | 2018 | 5 Pages |
Abstract
In addition, we design an FPT algorithm for interval graphs of bounded diameter. This leads us to exploring the problem of finding a partial coloring that maximizes the number of colored vertices.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Minki Kim, Bernard Lidický, TomáÅ¡ MasaÅÃk, Florian Pfender,