Skip to main content
SpringerLink
Log in

Separation pair detection

  • Parallel Tree Contraction
  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 319))

Included in the following conference series:

Abstract

A separation pair of a biconnected graph is a pair of vertices whose removal disconnects the graph. The central part of any algorithm that finds triconnected components is an algorithm for separation pairs. Recently Miller and Ramachandran have given a parallel algorithm that runs in O(log 2 n) time using O(m) processors. We present a new algorithm for finding all separation pairs of a biconnected graph that runs in O(log n) time using O(m) processors. A direct consequence is a test for triconnectivity of a graph within the same resource bounds.

This work was supported in part by the ONR under Contract N00014-86-K-0597.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, J. Komlos and E. Szemeredi, “An O(n log n) sorting network,” Combinatorica 3:1, 1983, pp. 1–19.

    MATH  MathSciNet  Google Scholar 

  2. D. Fussell and R. Thurimella, “Finding a sparse graph that preserves biconnectivity,” manuscript.

    Google Scholar 

  3. G.L. Miller and V. Ramachandran, “A new triconnectivity algorithm and its applications,” Proc. 19th annual STOC, NY, May 1987, pp. 335–344.

    Google Scholar 

  4. Y. Maon, B. Schieber and U. Vishkin, “Parallel ear decomposition search (EDS) and ST-numbering in graphs,” VLSI Algorithms and Architectures, Lecture Notes in Computer Science Vol. 227, 1986, pp. 34–45.

    MATH  MathSciNet  Google Scholar 

  5. Y. Shiloach and U. Vishkin, “An O(log n) parallel connectivity algorithm,” J. Algorithms 2, (1981), pp. 57–63.

    MathSciNet  Google Scholar 

  6. R. E. Tarjan and U. Vishkin, “An efficient parallel biconnectivity algorithm,” SIAM J. Computing, 14, (1984), pp. 862–874.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, The University of Texas at Austin, 78712, Austin, TX

    Donald Fussell & Ramakrishna Thurimella

Authors
  1. Donald Fussell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramakrishna Thurimella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John H. Reif

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fussell, D., Thurimella, R. (1988). Separation pair detection. In: Reif, J.H. (eds) VLSI Algorithms and Architectures. AWOC 1988. Lecture Notes in Computer Science, vol 319. Springer, New York, NY. https://doi.org/10.1007/BFb0040383

Download citation

  • DOI: https://doi.org/10.1007/BFb0040383

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96818-6

  • Online ISBN: 978-0-387-34770-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation