An expected polynomial time algorithm for coloring 2-colorable 3-graphsAuthors: Yury Person
1; Mathias Schacht
2
0000-0002-3091-3025##0000-0003-1762-4090
Yury Person;Mathias Schacht
- 1 Institut für Mathematik [Berlin]
- 2 Fachbereich Mathematik [Hamburg]
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).
Volume: Vol. 13 no. 2
Section: Graph and Algorithms
Published on: May 5, 2011
Accepted on: June 9, 2015
Submitted on: September 4, 2009
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]