4 search results - page 1 / 1 » Small Maximal Independent Sets and Faster Exact Graph Colori... |
WADS
2001
Springer
13 years 9 months ago
2001
Springer
DC
2010
13 years 5 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
FSTTCS
2007
Springer
13 years 11 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
SPAA
2009
ACM
13 years 11 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...