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

Authors:
Hiroshi Nagamochi;Toru Hasunuma
Affiliations:
-;-
Venue:
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Year:
1998

Citing 9
Cited 0

An improved parallel algorithm for maximal matching

Information Processing Letters
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
Introduction to algorithms

Introduction to algorithms
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Computing edge-connectivity in multigraphs and capacitated graphs

SIAM Journal on Discrete Mathematics
An introduction to parallel algorithms

An introduction to parallel algorithms
Scan-first search and sparse certificates: an improved parallel algorithm for k-vertex connectivity

SIAM Journal on Computing
An $\NC$ Algorithm for Minimum Cuts

SIAM Journal on Computing
A linear time 2 + &&egr; approximation algorithm for edge connectivity

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

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.