513 search results - page 11 / 103 » Soft Edge Coloring |
99
Voted
JCO
2007
15 years 9 days ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
107
click to vote
CVPR
2006
IEEE
15 years 6 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...
114
click to vote
AAIM
2010
Springer
15 years 3 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
FOCS
1996
IEEE
15 years 4 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
186
Voted
ICITS
2011
14 years 3 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...