720 search results - page 27 / 144 » Nonrepetitive colorings of graphs |
CAAN
2006
Springer
13 years 11 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
13 years 7 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...
CAE
2007
13 years 10 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...
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks. In this paper, we describe a new distributedmemory algorithm for doing t...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...