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.

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.

A_N_Trahtman_Partially_Synchronizing_Coloring.pdf



© Shiny World Corp., 2011-2019. All rights reserved. To reach us please send an e-mail to support@IntellectualArchive.com