| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652383 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
We present an algorithm that colors a random 2-colorable 3-uniform hypergraph optimally in expected running time O(n5log2n).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
