Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
DMTCS
2011
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(n5 log2 n).
Real-time TrafficDMTCS 2011 | Log2 | Mathematics | N5 | Running Time |
| Added | 18 Dec 2011 |
| Updated | 18 Dec 2011 |
| Type | Journal |
| Year | 2011 |
| Where | DMTCS |
| Authors | Yury Person, Mathias Schacht |
Comments (0)
Researcher Info
|
