A simple certifying algorithm for 3edgeconnectivity
Abstract
A lineartime certifying algorithm for 3edgeconnectivity is presented. Given an undirected graph G, if G is 3edgeconnected, the algorithm generates a construction sequence as a positive certificate for G. Otherwise, the algorithm decomposes G into its 3edgeconnected components and at the same time generates a construction sequence for each connected component as well as the bridges and a cactus representation of the cutpairs in G. All of these are done by making only one pass over G using an innovative graph contraction technique. Moreover, the graph need not be 2edgeconnected.
 Publication:

arXiv eprints
 Pub Date:
 February 2020
 arXiv:
 arXiv:2002.04727
 Bibcode:
 2020arXiv200204727T
 Keywords:

 Computer Science  Data Structures and Algorithms