Sciweavers

Share
AAECC
2011
Springer

The generalized road coloring problem and periodic digraphs

8 years 9 days ago
The generalized road coloring problem and periodic digraphs
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman’s algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.
G. Budzban, Ph. Feinsilver
Added 12 May 2011
Updated 12 May 2011
Type Journal
Year 2011
Where AAECC
Authors G. Budzban, Ph. Feinsilver
Comments (0)
books