Sciweavers

145 search results - page 5 / 29
» Strong Colorings of Hypergraphs
Sort
View
DAM
2008
59views more  DAM 2008»
14 years 9 months ago
Vertex coloring acyclic digraphs and their corresponding hypergraphs
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...
Geir Agnarsson, Ágúst S. Egilsson, M...
87
Voted
ICALP
2007
Springer
15 years 1 months ago
Online Conflict-Free Colorings for Hypergraphs
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 ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...
FOCS
2000
IEEE
15 years 1 months ago
Hardness of Approximate Hypergraph Coloring
Venkatesan Guruswami, Johan Håstad, Madhu Su...
FOCS
1998
IEEE
15 years 1 months ago
Improved Bounds and Algorithms for Hypergraph Two-Coloring
Jaikumar Radhakrishnan, Aravind Srinivasan
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
14 years 10 months ago
Approximating coloring and maximum independent sets in 3-uniform hypergraphs
Michael Krivelevich, Ram Nathaniel, Benny Sudakov