Person, Yury and Schacht, Mathias - An expected polynomial time algorithm for coloring 2-colorable 3-graphs

dmtcs:558 - Discrete Mathematics & Theoretical Computer Science, May 5, 2011, Vol. 13 no. 2
An expected polynomial time algorithm for coloring 2-colorable 3-graphs

Authors: Person, Yury and Schacht, Mathias

We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O (n(5) log(2) n).


Source : oai:HAL:hal-00990504v1
Volume: Vol. 13 no. 2
Section: Graph and Algorithms
Published on: May 5, 2011
Submitted on: September 4, 2009
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]


Share

Browsing statistics

This page has been seen 61 times.
This article's PDF has been downloaded 59 times.