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
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2021.05.005 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Menger's theorem for graphs containing no infinite paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4520304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The internet of things: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for the st-order problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / rank
 
Normal rank
Property / cites work
 
Property / cites work: st-ordering the vertices of biconnected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing an st-numbering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilizing algorithm for finding biconnected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic self-stabilizing algorithm for constructing a transport net / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless Sensor Networks / rank
 
Normal 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
    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