765 search results - page 21 / 153 » Graph Coloring with Rejection |
IJCAI
2001
13 years 10 months ago
2001
We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
APPROX
2006
Springer
14 years 11 days ago
2006
Springer
Consider the following problem: For given graphs G and F1, . . . , Fk, find a coloring of the edges of G with k colors such that G does not contain Fi in color i. For example, if e...
SIAMDM
2008
13 years 8 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
SPAA
2009
ACM
14 years 3 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Let H = (V, E) be a hypergraph. A conflict-free coloring of H is an assignment of colors to V such that in each hyperedge e E there is at least one uniquely-colored vertex. This ...