## Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity (1992)

Venue: | Synthesis of Parallel Algorithms |

Citations: | 25 - 9 self |

### BibTeX

@INPROCEEDINGS{Ramachandran92parallelopen,

author = {Vijaya Ramachandran},

title = {Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity},

booktitle = {Synthesis of Parallel Algorithms},

year = {1992},

pages = {275--340},

publisher = {Morgan-Kaufmann}

}

### Years of Citing Articles

### OpenURL

### Abstract

This report deals with a parallel algorithmic technique that has proved to be very useful in the design of efficient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called "open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an efficient parallel algorithm for finding this decomposition and we relate it to a sequential algorithm based on depth-first search. We then apply open ear decomposition to obtain an efficient parallel algorithm for testing graph triconnectivity and for finding the triconnnected components of a graph.