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

Yonghwan Kim 0001, Masahiro Shibata, Yuichi Sudo, Junya Nakamura 0001, Yoshiaki Katayama, Toshimitsu Masuzawa. A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets. Theoretical Computer Science, 874:1-14, 2021. [doi]

Authors

Yonghwan Kim 0001

This author has not been identified. Look up 'Yonghwan Kim 0001' in Google

Masahiro Shibata

This author has not been identified. Look up 'Masahiro Shibata' in Google

Yuichi Sudo

This author has not been identified. Look up 'Yuichi Sudo' in Google

Junya Nakamura 0001

This author has not been identified. Look up 'Junya Nakamura 0001' in Google

Yoshiaki Katayama

This author has not been identified. Look up 'Yoshiaki Katayama' in Google

Toshimitsu Masuzawa

This author has not been identified. Look up 'Toshimitsu Masuzawa' in Google