Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

49

AAECC
2011
Springer

favoriteEmaildiscussreport

380views Algorithms» more AAECC 2011»

The generalized road coloring problem and periodic digraphs

12 years 12 months ago

The generalized road coloring problem and periodic digraphs

Download www.math.siu.edu

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

Real-time Traffic

AAECC 2011 | Algorithms | Periodic Markov Chains | Road Coloring Problem | Strongly Connected |

claim paper

Related Content

» On digraph coloring problems and treewidth duality

» Synchronization and Stability of Finite Automata

» A New Exam Scheduling Algorithm Using Graph Coloring

» Effective Lane Detection and Tracking Method Using Statistical Modeling of Color and Lane ...

» An evolutionary design technique for collective communications on optimal diameterdegree n...

» A Rear Vehicle Location Algorithm for Lane Change Assist

» Robust background estimation for complex video sequences

» AllocRay memory allocation visualization for unmanaged languages

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	AAECC
Authors	G. Budzban, Ph. Feinsilver

Comments (0)