Date: 29 Mar 2001

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

* Final gross prices may vary according to local VAT.

Get Access


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.