Yury Person ; Mathias Schacht - 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 - https://doi.org/10.46298/dmtcs.558
An expected polynomial time algorithm for coloring 2-colorable 3-graphs

Authors: Yury Person ORCID-iD; Mathias Schacht ORCID-iD

    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]

    Share

    Consultation statistics

    This page has been seen 440 times.
    This article's PDF has been downloaded 470 times.