A. N. Trahtman. A Partially Synchronizing Coloring
Natural Sciences / Computer Science / Automata theory
Submitted on: Apr 01, 2012, 20:50:06
Description: Some consequences for coloring of an arbitrary finite digraph are presented. We describe a subquadratic algorithm of the road coloring for the k-synchronization implemented in the package TESTAS. A new linear visualization program demonstrates the obtained coloring. Some consequences for coloring of an arbitrary finite digraph and of such a graph of uniform outdegree are presented.