Abstract
We present an efficient NC algorithm for finding a sparse k-edge-connectivity certificate of a multigraph G. Our algorithm runs in O((logkn)(logk)2(logn)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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
