Skip to main content
SpringerLink
Log in

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

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

Included in the following conference series:

  • 566 Accesses

Abstract

We present an efficient NC algorithm for finding a sparse k-edge-connectivity certificate of a multigraph G. Our algorithm runs in O((log kn)(log k)2(log n)2) time using O(k(n + m′)) processors on an ARBITRARY CRCW PRAM, where n and m' stand for the numbers of vertices in G and edges in the simplified graph of G, respectively.

This research was partially supported by the Scientific Grant-in-Aid from Ministry of Education, Science, Sports and Culture of Japan and the subsidy from the Inamori Foundation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Cheriyan, M.Y. Kao, and R. Thurimella, Scan-first search and sparse certificates An improved parallel algorithm for k-vertex connectivity, SIAM J. Comput. 221993157–174.

    Article  MATH  MathSciNet  Google Scholar 

  2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms (The MIT Press, Cambridge MA1990

    Google Scholar 

  3. A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matchingInform. Process. Lett. 22 1986 57–60

    Article  MATH  MathSciNet  Google Scholar 

  4. J. JáJá, An Introduction to Parallel Algorithms (Addison-Wesley, Reading MA1992

    MATH  Google Scholar 

  5. D.R. Karger and R. Motwani, An NC algorithm for minimum cutsSIAM J. Comput.261997)255–272.

    Article  MATH  MathSciNet  Google Scholar 

  6. R.M. Karp and V. Ramachandran, Parallel algorithms for shared memory machines in J. van Leeuwen Ed Handbook of Theoretical Computer Science, Vol. A (Elsevier, Amsterdam 1990)869–941

    Google Scholar 

  7. D.W. Matula, A linear time 2 + e approximation algorithm for edge connectivity, in:Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms1993500–504

    Google Scholar 

  8. H. Nagamochi and T. Ibaraki, A linear-time algorithm for finding a sparse k- connected spanning subgraph of a k-connected graph, Algorithmica 7 1992 583–596

    Article  MathSciNet  MATH  Google Scholar 

  9. H. Nagamochi and T. Ibaraki, Computing edge-connectivity of multigraphs and capacitated graphsSIAM J. Disc. Math.51992 54–66

    Article  MATH  MathSciNet  Google Scholar 

  10. Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm J.of Algorithms 3 1982 57–67.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics Graduate School of Informatics, Kyoto University, Japan

    Hiroshi Nagamochi & Toru Hasunuma

Authors
  1. Hiroshi Nagamochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toru Hasunuma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagamochi, H., Hasunuma, T. (1998). An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation