A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths
From MaRDI portal
Publication:6320309
arXiv1906.04523MaRDI QIDQ6320309
Author name not available (Why is that?)
Publication date: 11 June 2019
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/.
Has companion code repository: https://github.com/cat-astrophic/MDC-orientations_of_paths
This page was built for publication: A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320309)