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

  • Hiroshi Nagamochi
  • Toru Hasunuma
Conference paper

DOI: 10.1007/3-540-49381-6_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1533)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Hiroshi Nagamochi
    • 1
  • Toru Hasunuma
    • 1
  1. 1.Department of Applied Mathematics and Physics Graduate School of InformaticsKyoto UniversityJapan

Personalised recommendations