Complexity of Road Coloring with Prescribed Reset Words
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10392117" target="_blank" >RIV/00216208:11320/19:10392117 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=xZldR8Di5w" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=xZldR8Di5w</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2016.05.009" target="_blank" >10.1016/j.jcss.2016.05.009</a>
Alternative languages
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 strongly connected 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. In this paper we consider the following problem: given a word w and digraph G, is it true that G has a coloring that is synchronized by w? We show that it is NP-complete for certain fixed words. For the binary alphabet we present a classification that separates such words from those that make the problem solvable in polynomial time. The classification differs if we consider only strongly connected multigraphs. In this restricted setting the classification remains incomplete.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Computer and System Sciences
ISSN
0022-0000
e-ISSN
—
Volume of the periodical
Neuveden
Issue of the periodical within the volume
červenec
Country of publishing house
US - UNITED STATES
Number of pages
24
Pages from-to
763-786
UT code for WoS article
000472246300020
EID of the result in the Scopus database
2-s2.0-85048737408