Skip to main content
SpringerLink
Log in

Finding triconnected components by local replacements

Extended abstract

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1989)

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

Included in the following conference series:

Abstract

We present an almost-optimal parallel algorithm for finding triconnected components on a CRCW PRAM. The time complexity of our algorithm is O(log n) and the processor-time product is O((m + n)·α(m, n)) where α is the inverse Ackerman function; here n is the number of vertices, and m is the number of edges in the graph. The algorithm is optimal for m≥n log* n. Our algorithm, like other parallel algorithms for this problem, is based on ear decomposition but it employs a new technique, local replacement, to improve the complexity. Only the need to find connected components, for which no optimal parallel algorithm that runs in O(log n) time is known, prevents our algorithm from achieving optimality on an EREW PRAM.

Supported in part by the ONR under Contracts N00014-86-K-0763 and N00014-86-K-0597.

Supported in part by Joint Services Electronics Program under contract N00014-85-C-0149 while this author was with the University of Illinois, Urbana.

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. R. Cole and U. Vishkin, “Approximate and exact parallel scheduling with applications to list, tree, and graph problems,” Proc. 27th Symp. Found. Comp. Sci., 1986, pp. 478–491.

    Google Scholar 

  2. S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.

    Google Scholar 

  3. D. Fussell and R. Thurimella, “Separation pair detection,” VLSI Algorithms and Architectures, Springer-Verlag LNCS, vol. 319, 1988, pp. 149–159.

    Google Scholar 

  4. J. E. Hopcroft, and R. E. Tarjan, “Finding the triconnected components of a graph,” TR 72–140, Computer Science Department, Cornell University, Ithaca, NY, 1972.

    Google Scholar 

  5. J. E. Hopcroft, and R. E. Tarjan, “Dividing a graph into triconnected components,” SIAM J. Computing, vol. 2, 1973, pp. 135–158.

    Article  Google Scholar 

  6. H. Jung, private communication.

    Google Scholar 

  7. J. Já Já, and J. Simon, “Parallel algorithms in Graph theory: Planarity Testing,” SIAM J. Computing, vol. 11, 1982, pp. 314–328.

    Article  Google Scholar 

  8. R. M. Karp, V. Ramachandran, “A survey of parallel algorithms for shared-memory machines,” Report No. UCB/CSD 88/408, University of California, Berkeley, CA, 1988; also, Handbook of Theoretical Computer Science, North-Holland, 1989, to appear.

    Google Scholar 

  9. G.L. Miller, and J. Reif, “Parallel tree contraction and its applications,” Proc. 26th Symp. Found. Comp. Sci., October 1985, pp. 478–489.

    Google Scholar 

  10. G.L. Miller, and V. Ramachandran, “Efficient parallel ear decomposition with applications,” Manuscript, MSRI, Berkeley, CA, January 1986.

    Google Scholar 

  11. G.L. Miller, and V. Ramachandran, “A new triconnectivity algorithm and its applications,” Proc. 19th Ann. ACM Symp. on Theory of Computing, May 1987, pp. 335–344.

    Google Scholar 

  12. Y. Maon, B. Schieber, and U. Vishkin, “Parallel ear decomposition search (EDS) and ST-numbering in graphs,” Theoretical Computer Science, vol. 47, 1986, pp. 277–298.

    Article  Google Scholar 

  13. V. Ramachandran, and U. Vishkin, “Efficient parallel triconnectivity in logarithmic time,” VLSI Algorithms and Architectures, Springer-Verlag LNCS, vol. 319, 1988, pp. 33–42.

    Google Scholar 

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

    Google Scholar 

  15. B. Schieber, U. Vishkin, “On finding lowest common ancestors: simplification and parallelization,” VLSI Algorithms and Architectures, Springer-Verlag LNCS 319, 1988, pp. 111–123.

    Google Scholar 

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

    Article  Google Scholar 

  17. W. T. Tutte, Connectivity in Graphs, University of Toronto Press, 1966.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Donald Fussell, Vijaya Ramachandran & Ramakrishna Thurimella

Authors
  1. Donald Fussell
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijaya Ramachandran
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ramakrishna Thurimella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fussell, D., Ramachandran, V., Thurimella, R. (1989). Finding triconnected components by local replacements. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035771

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation