A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given

DOI10.2478/V10065-012-0038-7zbMath1317.68263OpenAlexW4242746550MaRDI QIDQ5500391

Halina Bielak, Michał Pańczyk

Publication date: 6 August 2015

Published in: Annales UMCS, Informatica (Search for Journal in Brave)

Full work available at URL: http://journals.umcs.pl/ai/article/view/3370

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Self-stabilizing depth-first search
• A self-stabilizing algorithm for detecting fundamental cycles in a graph
• Self-stabilizing systems in spite of distributed control
• The Two-Triangle Case of the Acquaintance Graph

This page was built for publication: A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given