A complete solution to the complexity of synchronizing road coloring for non-binary alphabets
From MaRDI portal
Publication:2346422
DOI10.1016/j.ic.2015.04.004zbMath1316.68059OpenAlexW2069330650MaRDI QIDQ2346422
Publication date: 1 June 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.04.004
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Complexity of road coloring with prescribed reset words, Černý's conjecture and the road colouring problem
Cites Work