A self-stabilizing algorithm for cut problems in synchronous networks
From MaRDI portal
Publication:962165
DOI10.1016/j.tcs.2010.01.008zbMath1191.68057OpenAlexW1974257767MaRDI QIDQ962165
Thomas Sauerwald, Dirk Sudholt
Publication date: 6 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.008
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- 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
- On the analysis of the \((1+1)\) evolutionary algorithm
- Maximal matching stabilizes in time \(O(m)\)
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Graph treewidth and geometric thickness parameters
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- Self-stabilizing Cuts in Synchronous Networks
- Self-stabilizing systems in spite of distributed control
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
- Probability Inequalities for Sums of Bounded Random Variables
- Probability and Computing
