4 search results - page 1 / 1 » Online Conflict-Free Colorings for Hypergraphs |
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
63
Voted
CORR
2010
Springer
14 years 11 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 ...
112
click to vote
WAOA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
IPL
2010
14 years 10 months ago
2010