A self-stabilizing 1-maximal independent set algorithm

DOI10.1007/978-3-030-34992-9_27MaRDI QIDQ6536341zbMATH OpenFDO

Authors Hideyuki Tanaka, Yuichi Sudo, Hirotsugu Kakugawa, Toshimitsu Masuzawa, Ajoy K. Datta

Publication date 19 April 2024

Mathematics Subject Classification ID

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

Recommendations

• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• Luby's MIS algorithms made self-stabilizing
• An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks

Cites work

• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• On generalised minimal domination parameters for paths
• Self-stabilization
• Self-stabilizing systems in spite of distributed control

Cited in

(1)

• Luby's MIS algorithms made self-stabilizing

This page was built for publication: A self-stabilizing 1-maximal independent set algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536341)