A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets (Q2034405): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2021.05.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2021.05.005 / rank | |||
Normal rank | |||
Latest revision as of 20:19, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets |
scientific article |
Statements
A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets (English)
0 references
22 June 2021
0 references
self-stabilization
0 references
directed acyclic graph
0 references
strong reachable DAG
0 references
