1986 search results - page 35 / 398 » Path Separability of Graphs |
CDC
2009
IEEE
14 years 1 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...
JCT
2006
13 years 8 months ago
2006
The Frankl-R
ISAAC
2009
Springer
14 years 1 months ago
2009
Springer
For a graph G and a collection of vertex pairs {(s1, t1), . . . , (sk, tk)}, the k disjoint paths problem is to find k vertex-disjoint paths P1, . . . , Pk, where Pi is a path fr...
NETWORKS
2011
13 years 3 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...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...