Advertisement

The External Network Problem with Edge- or Arc-Connectivity Requirements

  • Jan van den Heuvel
  • Matthew Johnson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3405)

Abstract

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 1v s , p 2=w 1w 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.

Keywords

Undirected Graph External Network Polynomial Algorithm Chordal Graph Relation Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Diestel, R.: Graph Theory. Springer, New York (1997)zbMATHGoogle Scholar
  2. 2.
    van den Heuvel, J., Johnson, M.: The External Network Problem with vertex-connectivity requirements (in preparation)Google Scholar
  3. 3.
    Hao, J., Orlin, J.B.: A faster algorithm for finding the minimum cut in a graph. J. of Algorithms 17, 424–446 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Ito, H., Ito, M., Itatsu, Y., Uehara, H., Yokohama, M.: Location problems based on node-connectivity and edge-connectivity between nodes and node-subsets. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 338–349. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Ito, H., Makino, K., Arata, K., Honami, S., Itatsu, Y., Fujishige, S.: Source location problem with flow requirements in directed networks. Optimization Methods and Software 18, 427–435 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Nagamochi, H., Ishii, T., Ito, H.: Minimum cost source location problem with vertex-connectivity requirements in digraphs. Info. Process Letters 80, 287–294 (2001)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jan van den Heuvel
    • 1
  • Matthew Johnson
    • 1
  1. 1.Centre for Discrete and Applicable Mathematics, Department of MathematicsLondon School of EconomicsLondonUK

Personalised recommendations