Title of article :
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Author/Authors :
Person، نويسنده , , Yury and Schacht، نويسنده , , Mathias، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2009
Abstract :
We present an algorithm that colors a random 2-colorable 3-uniform hypergraph optimally in expected running time O ( n 5 log 2 n ) .
Keywords :
Coloring , Hypergraphs , average case analysis
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
