Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications

DOI10.1007/978-3-030-91081-5_22zbMath1521.68247MaRDI QIDQ6488445

Taisuke Izumi, Yuichi Sudo, Toshimitsu Masuzawa, Rongcheng Dong

Publication date: 21 April 2023

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Loosely-stabilizing leader election in a population protocol model
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• Self-stabilization over unreliable communication media
• Stabilizing data-link over non-FIFO channels with optimal fault-resilience
• Making randomized algorithms self-stabilizing
• The Locality of Distributed Symmetry Breaking
• On Space and Time Complexity of Loosely-Stabilizing Leader Election
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• Self-stabilizing systems in spite of distributed control
• Polylogarithmic-time deterministic network decomposition and distributed derandomization

This page was built for publication: Loosely-Stabilizing Maximal Independent Set Algorithms with Unreliable Communications