765 search results - page 73 / 153 » Graph Coloring with Rejection |
160
click to vote
FOSSACS
2006
Springer
15 years 6 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
135
click to vote
JCO
2011
14 years 10 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
113
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
121
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
124
click to vote
CC
2006
Springer
15 years 6 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...