Parameterized complexity of synchronization and road coloring
V Vorel, A Roman - Discrete Mathematics & Theoretical …, 2015 - dmtcs.episciences.org
V Vorel, A Roman
Discrete Mathematics & Theoretical Computer Science, 2015•dmtcs.episciences.org… Second, we consider a related canonical problem concerning synchronizing road colorings
(SRCP). Here we give a similar complete multi-parameter analysis. Namely, we show that
the problem, … In the present paper we close the multi-parameter analyses of canonical
problems SYN and SRCP related to synchronization and road coloring. The study of SYN
was initiated in 2013 by Fernau, Heggernes, and Villanger [8, 9]. The results about SRCP
give complete answers to the questions raised by the second author and Drewienkowski …
(SRCP). Here we give a similar complete multi-parameter analysis. Namely, we show that
the problem, … In the present paper we close the multi-parameter analyses of canonical
problems SYN and SRCP related to synchronization and road coloring. The study of SYN
was initiated in 2013 by Fernau, Heggernes, and Villanger [8, 9]. The results about SRCP
give complete answers to the questions raised by the second author and Drewienkowski …
Automata, Logic and Semantics
dmtcs.episciences.org
Showing the best result for this search. See all results