1749 search results - page 20 / 350 » Conditional colorings of graphs |
DMTCS
2011
12 years 8 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).
ICPR
2008
IEEE
14 years 9 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
14 years 1 months ago
2004
Springer
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
DSD
2003
IEEE
14 years 1 months ago
2003
IEEE
Heuristic algorithms for coloring the edges of large undirected single-edge graphs with (or very close to) the minimal number of colors are presented. Compared to simulated anneal...