Loosely-stabilizing maximal independent set algorithms with unreliable communications
From MaRDI portal
Publication:2089676
Recommendations
Cites work
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- scientific article; zbMATH DE number 2036573 (Why is no real title available?)
- Loosely-stabilizing leader election in a population protocol model
- Loosely-stabilizing leader election with polylogarithmic convergence time
- Making randomized algorithms self-stabilizing
- On space and time complexity of loosely-stabilizing leader election
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Quasi-self-stabilization of a distributed system assuming read/write atomicity
- Self-stabilization over unreliable communication media
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- Self-stabilizing systems in spite of distributed control
- Stabilizing data-link over non-FIFO channels with optimal fault-resilience
- The locality of distributed symmetry breaking
Cited in
(2)
This page was built for publication: Loosely-stabilizing maximal independent set algorithms with unreliable communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089676)