145 search results - page 5 / 29 » Strong Colorings of Hypergraphs |
DAM
2008
14 years 11 months ago
2008
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
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 ...
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
FOCS
1998
IEEE
15 years 4 months ago
1998
IEEE
SODA
2001
ACM
15 years 1 months ago
2001
ACM