A Simple 3-Edge-Connected Component Algorithm
Article
First Online:
Received:
Revised:
- 200 Downloads
- 12 Citations
Abstract
A simple linear-time algorithm for finding all the 3-edge-connected components of an undirected graph is presented. The algorithm performs only one depth-first search over the given graph. Previously best known algorithms perform multiple depth-first searches in multiple phases.
Keywords
Connected Graph Undirected Graph Edge Incident Recursive Call Component Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
Copyright information
© Springer 2005