Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
DOI10.1016/J.IPL.2014.02.002zbMATH Open1284.68642OpenAlexW2071852002MaRDI QIDQ2446589FDOQ2446589
Authors: Yacine Belhoul, Saïd Yahiaoui, H. Kheddouci 
Publication date: 17 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.002
Recommendations
- scientific article; zbMATH DE number 2061538
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
- Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
- Linear-time self-stabilizing algorithms for minimal domination in graphs
graph algorithmsminimal total dominating set\(k\)-tuple total dominating setdistributed self-stabilizing algorithmsminimal total \(k\)-domination
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-stabilization
- Total domination in graphs
- Self-stabilizing systems in spite of distributed control
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- \(k\)-tuple total domination in graphs
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Distance-\(k\) knowledge in self-stabilizing algorithms
- Algorithmic aspects of \(k\)-tuple total domination in graphs
- \(k\)-tuple total domination in cross products of graphs
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- 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
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS
- High Performance Computing - HiPC 2003
Cited In (22)
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Title not available (Why is that?)
- A self-stabilizing algorithm for optimally efficient sets in graphs
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- Fast, silent self-stabilizing distance-\(k\) independent dominating set construction
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem
- Self-stabilizing minimal global offensive alliance algorithm with safe convergence in an arbitrary graph
- A self-stabilizing algorithm for constructing weakly connected minimal dominating sets
- Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
- Linear-time self-stabilizing algorithms for minimal domination in graphs
- New self-stabilizing algorithms for minimal weakly connected dominating sets
- A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
- A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
- Efficient self-stabilizing algorithm for independent strong dominating sets in arbitrary graphs
- Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
- A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
- Self-stabilizing algorithm for two disjoint minimal dominating sets
- Distributed Computing - IWDC 2003
- A self-stabilizing algorithm for edge monitoring in wireless sensor networks
- Self-Stabilizing Domination Algorithms
- Title not available (Why is that?)
This page was built for publication: Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446589)
