718 search results - page 23 / 144 » Coloring quasi-line graphs |
67
Voted
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
81
Voted
PDPTA
2003
14 years 11 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
81
Voted
CAAN
2006
Springer
15 years 1 months ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
DAM
2006
14 years 9 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
64
Voted
CAE
2007
14 years 12 months ago
2007
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...