1172 search results - page 47 / 235 » Path Algorithms on Regular Graphs |
ICIP
2004
IEEE
15 years 24 days ago
2004
IEEE
We present a new semi-automatic segmentation tool, which is motivated by the Intelligent Scissors algorithm [1], but which uses a modified concept of user-interaction. This new in...
CDC
2009
IEEE
14 years 3 months ago
2009
IEEE
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
NETWORKS
2011
13 years 6 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
FOCS
1996
IEEE
14 years 3 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...