A self-stabilizing algorithm for maximal matching (Q1199938): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3775564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for constructing spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / 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: A belated proof of self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing unison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic self-stabilization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for constructing breadth-first trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exercise in proving self-stabilization with a variant function / rank
 
Normal rank

Revision as of 11:53, 17 May 2024

scientific article
Language Label Description Also known as
English
A self-stabilizing algorithm for maximal matching
scientific article

    Statements

    A self-stabilizing algorithm for maximal matching (English)
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    distributed systems
    0 references
    fault-tolerance
    0 references
    self-stabilization
    0 references
    maximal matching
    0 references
    variant function
    0 references

    Identifiers