28 search results - page 1 / 6 » Finding Paths with Minimum Shared Edges |
COCOON
2011
Springer
12 years 4 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
ISAAC
1992
Springer
13 years 8 months ago
1992
Springer
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
JCO
2006
13 years 4 months ago
2006
Abstract. We study efficient algorithms for establishing reliable connections with bandwidth guarantees in communication networks. In the normal mode of operation, each connection ...
INFOCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
TON
2010
12 years 11 months ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...