Advertisement

Parallel algorithms for finding Steiner forests in planar graphs

  • Hitoshi Suzuki
  • Chiseko Yamanaka
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 450)

Abstract

Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the terminals of a net. This paper presents four parallel algorithms for the Steiner forest problem and a related one. The first algorithm solves the problem for the case all the terminals are located on the outer boundary of G in O(log2n) time using O(n3/log n) processors on a CREW PRAM, where n is the number of vertices in G. The second algorithm solves the problem for the case all terminals of each net lie on one of a fixed number of face boundaries in poly-log time using a polynomial number of processors. The third solves the problem for the case all terminals lie on two face boundaries. The fourth finds a maximum number of internally disjoint paths between two specified vertices in planar graphs. Both the third and fourth run either in O(log2n) time using O(n6/log n) processors or in (log3n) time using O(n3/log n) processors.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CLC]
    F. Y. Chin, J. Lam and I. Chen, Efficient parallel algorithms for some graph problems, Communications of the ACM 25, 9 (1982).Google Scholar
  2. [GR]
    A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, Cambridge (1988).Google Scholar
  3. [KS]
    S. Khuller and B. Schieber, Efficient parallel algorithms for testing connectivity and finding disjoint s-t paths in graphs, Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 288–293 (1989).Google Scholar
  4. [KL]
    M. R. Kramer and J. van Leeuwen, Wire-routing is NP-complete, Report No. RUU-CS-82-4, Department of Computer Science, University of Utrecht, Utrecht, the Netherlands (1982).Google Scholar
  5. [Lyn]
    J. F. Lynch, The equivalence of theorem proving and the interconnection problem, ACM SIGDA Newsletter 5:3, pp. 31–65 (1975).Google Scholar
  6. [Men]
    K. Menger, Zur allgemeinen Kurventheorie, Fund. Math., 10, pp. 95–115 (1927).Google Scholar
  7. [RS]
    N. Robertson and P. D. Seymour, Graph minors. VI. Disjoint paths across a disc, Journal of Combinatorial Theory, Series B, 41, pp. 115–138 (1986).Google Scholar
  8. [Sch1]
    A. Schrijver, Disjoint homotopic trees in a planar graph, manuscript(1988).Google Scholar
  9. [Sch2]
    A. Schrijver, personal communication (1988).Google Scholar
  10. [SAN]
    H. Suzuki, T. Akama and T. Nishizeki, Finding Steiner forests in planar graphs, Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, pp. 444–453(1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Hitoshi Suzuki
    • 1
  • Chiseko Yamanaka
    • 1
  • Takao Nishizeki
    • 1
  1. 1.Department of Information Engineering, Faculty of EngineeringTohoku UniversitySendaiJapan

Personalised recommendations