Extending Lattice Linearity for Self-stabilizing Algorithms
From MaRDI portal
Extending Lattice Linearity for Self-stabilizing Algorithms
Recommendations
- scientific article; zbMATH DE number 1696676
- scientific article; zbMATH DE number 2013825
- Self-stabilizing \(\ell\)-exclusion
- Making randomized algorithms self-stabilizing
- A note on the parallel runtime of self-stabilizing graph linearization
- scientific article; zbMATH DE number 512850
- Self-stabilizing extensions for message-passing systems
- Linearization: locally self-stabilizing sorting in graphs
- Efficient transformation of distance-2 self-stabilizing algorithms
Cites work
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Approximation of Self-stabilizing Vertex Cover Less Than 2
- Distributed Computing - IWDC 2003
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Self-stabilizing vertex cover in anonymous networks with optimal approximation ratio
Cited in
(2)
This page was built for publication: Extending Lattice Linearity for Self-stabilizing Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488448)
