Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

DOI10.1016/j.ipl.2013.03.001zbMath1358.05289OpenAlexW1974049003MaRDI QIDQ396595

Saïd Yahiaoui, Mohammed Haddad, Hamamache Kheddouci, Yacine Belhoul

Publication date: 13 August 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.03.001

zbMATH Keywords

graph algorithmsdistributed algorithmsglobal powerful allianceself-stabilizing algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)

Related Items (4)

Secure sets and their expansion in cubic graphs ⋮ Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs ⋮ Self-Stabilizing Domination Algorithms ⋮ Algorithms and Complexity of Alliances in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive self-stabilizing \(k\)-clustering
• Efficient transformation of distance-2 self-stabilizing algorithms
• An efficient self-stabilizing distance-2 coloring algorithm
• A self-stabilizing algorithm for optimally efficient sets in graphs
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Powerful alliances in graphs
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• A Fast Algorithm for Powerful Alliances in Trees
• Self-stabilizing systems in spite of distributed control

This page was built for publication: Self-stabilizing algorithms for minimal global powerful alliance sets in graphs