Self-stabilizing Cuts in Synchronous Networks

DOI10.1007/978-3-540-69355-0_20zbMath1143.68339OpenAlexW1841624801MaRDI QIDQ3511402

Thomas Sauerwald, Dirk Sudholt

Publication date: 10 July 2008

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)

Related Items (2)

Self-stabilizing Cuts in Synchronous Networks ⋮ A self-stabilizing algorithm for cut problems in synchronous networks

Cites Work

• Unnamed Item
• Unnamed Item
• A new self-stabilizing maximal matching algorithm
• Linear time self-stabilizing colorings
• Self-stabilizing coloration in anonymous planar networks
• A self-stabilizing algorithm for coloring planar graphs
• A short proof of Nash-Williams' theorem for the arboricity of a graph
• Maximal matching stabilizes in time \(O(m)\)
• A study of drift analysis for estimating computation time of evolutionary algorithms
• Self-stabilizing Cuts in Synchronous Networks
• Self-stabilizing systems in spite of distributed control

This page was built for publication: Self-stabilizing Cuts in Synchronous Networks