Parameterized complexity of synchronization and road coloring - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

Parameterized complexity of synchronization and road coloring

Abstract

First, we close the multi-parameter analysis of a canonical problem concerning short reset words (SYN) initiated by Fernau et al. (2013). Namely, we prove that the problem, parameterized by the number of states, does not admit a polynomial kernel unless the polynomial hierarchy collapses. 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, parameterized by the number of states, admits a polynomial kernel and we close the previous research of restrictions to particular values of both the alphabet size and the maximum length of a reset word.
Fichier principal
Vignette du fichier
dmtcs-17-1-18.pdf (394.62 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01196846 , version 1 (10-09-2015)

Identifiers

Cite

Vojtěch Vorel, Adam Roman. Parameterized complexity of synchronization and road coloring. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.283--305. ⟨10.46298/dmtcs.2103⟩. ⟨hal-01196846⟩

Collections

TDS-MACS
57 View
951 Download

Altmetric

Share

Gmail Facebook X LinkedIn More