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]

@article{KimSSNKM21,
  title = {A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets},
  author = {Yonghwan Kim 0001 and Masahiro Shibata and Yuichi Sudo and Junya Nakamura 0001 and Yoshiaki Katayama and Toshimitsu Masuzawa},
  year = {2021},
  doi = {10.1016/j.tcs.2021.05.005},
  url = {https://doi.org/10.1016/j.tcs.2021.05.005},
  researchr = {https://researchr.org/publication/KimSSNKM21},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {874},
  pages = {1-14},
}