52 search results - page 2 / 11 » On the computational complexity of strong edge coloring |
CVPR
2006
IEEE
13 years 10 months ago
2006
IEEE
Inspired by multi-scale tensor voting, a computational framework for perceptual grouping and segmentation, we propose an edge-directed technique for color image superresolution gi...
WG
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
ISCAS
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
PR
2007
13 years 4 months ago
2007
In this paper, a novel method for accurate subject tracking, by selecting only tracked subject boundary edges in a video stream with a changing background and moving camera, is pr...