On finding an ear decomposition of an undirected graph distributively

DOI10.1016/J.IPL.2004.04.004MaRDI QIDQ2390301zbMATH OpenOpenAlexFDO

Authors Yung H. 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

communication networkdistributed algorithmsear decompositiongraph algorithms

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites work

• Depth-First Search and Linear Graph Algorithms
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• Some remarks on distributed depth-first search.

Cited in

(2)

• Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
• An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390301)