Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
DOI10.1142/S0129054115500422zbMATH Open1332.68174OpenAlexW2206986926MaRDI QIDQ3455752FDOQ3455752
Authors: Brahim Neggazi, Nabil Guellati, Mohammed Haddad, H. Kheddouci 
Publication date: 11 December 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054115500422
Recommendations
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- New self-stabilizing algorithms for minimal weakly connected dominating sets
- Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- Self-stabilizing algorithm for two disjoint minimal dominating sets
dominating setfault-tolerancedistributed algorithmindependent setself-stabilizationweak dominationindependent strong dominating-set
Graph algorithms (graph-theoretic aspects) (05C85) 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
- Self-stabilizing systems in spite of distributed control
- Strong weak domination and domination balance in a graph
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
- On parameters related to strong and weak domination in graphs
- A \(4n\)-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
Cited In (5)
- A self-stabilizing algorithm for optimally efficient sets in graphs
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A note of independent number and domination number of \(Q_{n, k, m}\)-graph
- A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
- Self-Stabilizing Domination Algorithms
This page was built for publication: Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455752)
