The External Network Problem with Edge- or Arc-Connectivity Requirements
The connectivity of a communications network can often be enhanced if the nodes are able, at some expense, to form links using an external network. In this paper, we consider the problem of how to obtain a prescribed level of connectivity with a minimum number of nodes connecting to the external network.
Let D = (V,A) be a digraph. A subset X of vertices in V may be chosen, the so-called external vertices. An internal path is a normal directed path in D; an external path is a pair of internal paths p 1=v 1 ⋯ v s , p 2=w 1 ⋯ w t in D such that v s and w 1 are external vertices ( the idea is that v 1 can contact w t along this path using an external link from v t to w 1 ). Then (D,X) is externally-k-arc-strong if for each pair of vertices u and v in V, there are k arc-disjoint paths ( which may be internal or external ) from u to v.
We present polynomial algorithms that, given a digraph D and positive integer k, will find a set of external vertices X of minimum size subject to the requirement that (D,X) must be externally-k-arc-strong.
KeywordsUndirected Graph External Network Polynomial Algorithm Chordal Graph Relation Graph
Unable to display preview. Download preview PDF.
- 2.van den Heuvel, J., Johnson, M.: The External Network Problem with vertex-connectivity requirements (in preparation)Google Scholar