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

DOI10.1016/J.IPL.2013.03.001MaRDI QIDQ396595zbMATH OpenOpenAlexFDO

Authors Saïd Yahiaoui, Yacine Belhoul, Mohammed Haddad, H. Kheddouci

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

distributed algorithmsgraph algorithmsglobal powerful allianceself-stabilizing algorithms

Mathematics Subject Classification ID

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

Recommendations

• Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
• A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
• A fast algorithm for powerful alliances in trees

Cites work

• scientific article; zbMATH DE number 1919504 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• scientific article; zbMATH DE number 5237261 (Why is no real title available?)
• A fast algorithm for powerful alliances in trees
• A self-stabilizing algorithm for optimally efficient sets in graphs
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• An efficient self-stabilizing distance-2 coloring algorithm
• Competitive self-stabilizing \(k\)-clustering
• Distance-\(k\) knowledge in self-stabilizing algorithms
• Efficient transformation of distance-2 self-stabilizing algorithms
• Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
• Powerful alliances in graphs
• Self-stabilization
• Self-stabilizing systems in spite of distributed control

Cited in

(6)

• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph
• Secure sets and their expansion in cubic graphs
• Self-Stabilizing Domination Algorithms
• A self-stabilizing algorithm for optimally efficient sets in graphs
• Algorithms and Complexity of Alliances in Graphs

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

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