9 search results - page 1 / 2 » The generalized road coloring problem and periodic digraphs |
216
Voted
AAECC
2011
Springer
14 years 7 months ago
2011
Springer
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. Algebra...
120
Voted
EJC
2008
15 years 12 days ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
116
click to vote
JUCS
2002
14 years 12 months ago
2002
: Let G = (V, E) be a strongly connected and aperiodic directed graph of uniform out-degree k. A deterministic finite automaton is obtained if the edges are colored with k colors i...
IAJIT
2008
15 years 11 days ago
2008
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
114
Voted
AISS
2010
14 years 9 months ago
2010
This paper proposes an effective lane detection and tracking method using statistical modeling of lane color and edge-orientation in the image sequence. At first, we will address ...