Complexity of Road Coloring with Prescribed Reset Words

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319651" target="_blank" >RIV/00216208:11320/15:10319651 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-15579-1_12" target="_blank" >http://dx.doi.org/10.1007/978-3-319-15579-1_12</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-15579-1_12" target="_blank" >10.1007/978-3-319-15579-1_12</a>

Result language
angličtina
Original language name
Complexity of Road Coloring with Prescribed Reset Words
Original language description
By the Road Coloring Theorem (Trahtman, 2008), the edges of any given aperiodic directed multigraph with a constant out-degree can be colored such that the resulting automaton admits a reset word. There may also be a need for a particular reset word to be admitted. For certain words it is NP-complete to decide whether there is a suitable coloring. For the binary alphabet, we present a classi?cation that separates such words from those that make the problem solvable in polynomial time. The classi- ?cation di?ers if we consider only strongly connected multigraphs. In this restricted setting the classi?cation remains incomplete.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)