A quadratic algorithm for road coloring - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2014

A quadratic algorithm for road coloring

Marie-Pierre Béal
  • Fonction : Auteur
  • PersonId : 841350
Dominique Perrin

Résumé

The Road Coloring Theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the Road Coloring Problem before being settled by A. Trahtman. Trahtman's proof leads to an algorithm that finds a synchronized labeling with a cubic worst-case time complexity. We show a variant of his construction with a worst-case complexity which is quadratic in time and linear in space. We also extend the Road Coloring Theorem to the periodic case.
Fichier principal
Vignette du fichier
roadJournalV3.pdf (257.54 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00627821 , version 1 (29-09-2011)
hal-00627821 , version 2 (30-05-2013)

Identifiants

Citer

Marie-Pierre Béal, Dominique Perrin. A quadratic algorithm for road coloring. Discrete Applied Mathematics, 2014, 169 (-), pp.15-29. ⟨10.1016/j.dam.2013.12.002⟩. ⟨hal-00627821v2⟩
132 Consultations
482 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More