145 search results - page 19 / 29 » Strong Colorings of Hypergraphs |
74
Voted
SCALESPACE
2009
Springer
15 years 4 months ago
2009
Springer
The Beltrami flow is an efficient non-linear filter, that was shown to be effective for color image processing. The corresponding anisotropic diffusion operator strongly couple...
81
Voted
GC
2007
Springer
14 years 9 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
75
Voted
ARSCOM
1998
14 years 9 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
IJCV
2002
14 years 9 months ago
2002
Abstract-- This paper presents an efficient implementation for correlation based stereo. Research in this area can roughly be divided in two classes: improving accuracy regardless ...
64
Voted
SIAMDM
2000
14 years 9 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...