A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon (Q2015142): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs / 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: Distance-\(k\) knowledge in self-stabilizing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing algorithms for minimal dominating sets and maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient transformation of distance-2 self-stabilizing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing - IWDC 2003 / rank
 
Normal rank

Latest revision as of 15:22, 8 July 2024

scientific article
Language Label Description Also known as
English
A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
scientific article

    Statements

    Identifiers