A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets

DOI10.1016/j.tcs.2021.05.005zbMath1504.68173OpenAlexW3160940394MaRDI QIDQ2034405

Junya Nakamura, Toshimitsu Masuzawa, Masahiro Shibata, Yuichi Sudo, Yong-Hwan Kim, Yoshiaki Katayama

Publication date: 22 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.05.005

zbMATH Keywords

directed acyclic graphself-stabilizationstrong reachable DAG

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Menger's theorem for graphs containing no infinite paths
• The internet of things: a survey
• A stabilizing algorithm for finding biconnected components
• st-ordering the vertices of biconnected graphs
• Computing an st-numbering
• A dynamic self-stabilizing algorithm for constructing a transport net
• A self-stabilizing algorithm for the st-order problem
• Self-stabilizing systems in spite of distributed control
• A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
• Wireless Sensor Networks

This page was built for publication: A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets