An expected polynomial time algorithm for coloring 2-colorable 3-graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

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 (n(5) log(2) n).
Fichier principal
Vignette du fichier
1357-6016-1-PB.pdf (328.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990504 , version 1 (13-05-2014)

Identifiers

Cite

Yury Person, Mathias Schacht. An expected polynomial time algorithm for coloring 2-colorable 3-graphs. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 2 (2), pp.1--18. ⟨10.46298/dmtcs.558⟩. ⟨hal-00990504⟩

Collections

TDS-MACS
92 View
1034 Download

Altmetric

Share

Gmail Facebook X LinkedIn More