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

From MaRDI portal
Revision as of 17:44, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2021
    0 references
    self-stabilization
    0 references
    directed acyclic graph
    0 references
    strong reachable DAG
    0 references

    Identifiers