A quadratic algorithm for road coloring

Details A quadratic algorithm for road coloring A quadratic algorithm for road coloring

2008-03-05

arxiv.org/abs/0803.0726v8

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A quadratic algorithm for road coloring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A quadratic algorithm for road coloring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A quadratic algorithm for road coloring will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13098