Distributed algorithms on edge connectivity problems

Abstract

Connectivity of a network dictates the routability and survivability of a network. Thispaper is to investigate the edge connectivity problems in distributed environments. For a given networkorgraph G, one can distributivelyfindbridges in the networkfirst thenfind the 2-edge conneted components. Both algorithmsproposed in this paper, bridgefinding and 2-edge connected component identifying, require only O(m) message complexity, where m is the number of edges in G. Besides, this paper also shows an efJicient distributed 2-edge cutset algorithm that has O(n message complexity, where n is the number of nodes in G.