On finding an ear decomposition of an undirected graph distributively

DOI10.1016/j.ipl.2004.04.004zbMath1192.68849OpenAlexW2066521362MaRDI QIDQ2390301

Yung Hyang Tsin

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.04.004

zbMATH Keywords

graph algorithmsdistributed algorithmscommunication networkear decomposition

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (3)

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity ⋮ Distributed computations in fully-defective networks ⋮ Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs

Cites Work

• Unnamed Item
• Some remarks on distributed depth-first search.
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: On finding an ear decomposition of an undirected graph distributively