A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths
Discrete Mathematics
2019-07-25 v2 Data Structures and Algorithms
Combinatorics
Abstract
In this paper we present an algorithm for finding a minimum dominator coloring of orientations of paths. To date this is the first algorithm for dominator colorings of digraphs in any capacity. We prove that the algorithm always provides a minimum dominator coloring of an oriented path and show that it runs in time. The algorithm is available at https://github.com/cat-astrophic/MDC-orientations_of_paths/.
Keywords
Cite
@article{arxiv.1906.04523,
title = {A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths},
author = {Michael Cary},
journal= {arXiv preprint arXiv:1906.04523},
year = {2019}
}