A. N. Trahtman. A Partially Synchronizing Coloring
Submitted on: Apr 01, 2012, 20:50:06
Natural Sciences / Computer Science / Automata theory
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.
The Library of Congress (USA) reference page : http://lccn.loc.gov/cn2013300046.
To read the article posted on Intellectual Archive web site please click the link below.