46 search results - page 1 / 10 » Coloring with no 2-Colored P4's |
65
Voted
COMBINATORICS
2004
15 years 12 days ago
2004
193
Voted
DMTCS
2011
14 years 10 days ago
2011
Abstract. We present an algorithm that for 2-colorable 3-uniform hypergraphs, finds a 2-coloring in average running time O(n5 log2 n).
100
Voted
SSS
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we present new distributed protocols to color even rings and general bipartite graphs. Our motivation is to provide algorithmic explanation for human subject experime...
RSA
2008
15 years 1 days ago
2008
: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...
71
Voted
JGT
2010
14 years 11 months ago
2010
