Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
DOI10.1016/J.IPL.2013.03.001zbMATH Open1358.05289OpenAlexW1974049003MaRDI QIDQ396595FDOQ396595
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
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
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)
Cites Work
- Competitive self-stabilizing \(k\)-clustering
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- 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
- Efficient transformation of distance-2 self-stabilizing algorithms
- An efficient self-stabilizing distance-2 coloring algorithm
- Title not available (Why is that?)
- A self-stabilizing algorithm for optimally efficient sets in graphs
- Title not available (Why is that?)
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
Cited In (6)
- Secure sets and their expansion in cubic graphs
- A self-stabilizing algorithm for optimally efficient sets in graphs
- Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph
- Algorithms and Complexity of Alliances in Graphs
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- Self-Stabilizing Domination Algorithms
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)
