Sciweavers

Share
DMTCS
2011

An expected polynomial time algorithm for coloring 2-colorable 3-graphs

7 years 6 months ago
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
Yury Person, Mathias Schacht
Added 18 Dec 2011
Updated 18 Dec 2011
Type Journal
Year 2011
Where DMTCS
Authors Yury Person, Mathias Schacht
Comments (0)
books