A self-stabilizing algorithm for cut problems in synchronous networks
From MaRDI portal
Recommendations
- Self-stabilizing Cuts in Synchronous Networks
- When graph theory helps self-stabilization
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A self-stabilizing graph algorithm: Finding the cutting center of a tree
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
Cites work
- A self-stabilizing algorithm for coloring planar graphs
- A short proof of Nash-Williams' theorem for the arboricity of a graph
- A study of drift analysis for estimating computation time of evolutionary algorithms
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- Graph treewidth and geometric thickness parameters
- scientific article; zbMATH DE number 1082101 (Why is no real title available?)
- scientific article; zbMATH DE number 1958330 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Linear time self-stabilizing colorings
- Maximal matching stabilizes in time \(O(m)\)
- On the analysis of the \((1+1)\) evolutionary algorithm
- On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
- Probability and Computing
- Probability Inequalities for Sums of Bounded Random Variables
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Self-stabilizing coloration in anonymous planar networks
- Self-stabilizing Cuts in Synchronous Networks
- Self-stabilizing systems in spite of distributed control
This page was built for publication: A self-stabilizing algorithm for cut problems in synchronous networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962165)
