762 search results - page 14 / 153 » Strategic Coloring of a Graph |
165
click to vote
DMTCS
2011
13 years 9 months 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).
ENDM
2000
14 years 9 months ago
2000
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology ...
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted ...
WEA
2004
Springer
15 years 2 months ago
2004
Springer
COMBINATORICS
2007
14 years 9 months ago
2007