Self-stabilizing Cuts in Synchronous Networks (Q3511402): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A short proof of Nash-Williams' theorem for the arboricity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / 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 self-stabilizing algorithm for coloring planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of drift analysis for estimating computation time of evolutionary algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal matching stabilizes in time \(O(m)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time self-stabilizing colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing coloration in anonymous planar networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new self-stabilizing maximal matching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing Cuts in Synchronous Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365128 / rank
 
Normal rank

Latest revision as of 12:13, 28 June 2024

scientific article
Language Label Description Also known as
English
Self-stabilizing Cuts in Synchronous Networks
scientific article

    Statements

    Identifiers