2 search results - page 1 / 1 » Why Almost All k-Colorable Graphs Are Easy to Color |
134
click to vote
MST
2010
15 years 22 days ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
131
Voted
JUCS
2002
15 years 2 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...