On finding an ear decomposition of an undirected graph distributively

Authors:
Y. H. Tsin
Affiliations:
School of Computer Science, University of Windsor, Windsor, Ontario, Canada N9B 3P4
Venue:
Information Processing Letters
Year:
2004

Citing 4
Cited 3

A time-optimal message-efficient distributed algorithm for depth-first-search

Information Processing Letters
An Optimal Distributed Ear Decomposition Algorithm with Applications to Biconnectivity and Outerplanarity Testing

IEEE Transactions on Parallel and Distributed Systems
Graph Algorithms

Graph Algorithms
Some remarks on distributed depth-first search

Information Processing Letters

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

Information Processing Letters
A simple test on 2-vertex- and 2-edge-connectivity

Information Processing Letters
Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract