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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:16, 1 February 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
