On finding an ear decomposition of an undirected graph distributively

DOI10.1016/J.IPL.2004.04.004zbMATH Open1192.68849OpenAlexW2066521362MaRDI QIDQ2390301FDOQ2390301

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

distributed algorithmsgraph algorithmscommunication networkear decomposition

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Some remarks on distributed depth-first search.

Cited In (3)

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

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)