scientific article; zbMATH DE number 2061538
From MaRDI portal
Publication:4457216
Recommendations
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
- Linear-time self-stabilizing algorithms for minimal domination in graphs
- Self-stabilizing algorithm for minimal dominating set with safe convergence in an arbitrary graph
Cited in
(17)- Self-Stabilizing Domination Algorithms
- Competitive self-stabilizing \(k\)-clustering
- A self-stabilizing algorithm for optimally efficient sets in graphs
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
- scientific article; zbMATH DE number 2061543 (Why is no real title available?)
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
- A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem
- On the complexity of the {\(k\)}-packing function problem
- Distributed algorithm for the maximal 2-packing in geometric outerplanar graphs
- NP-completeness of the \(\{k \}\)-packing function problem in graphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Distance-\(k\) knowledge in self-stabilizing algorithms
- A self-stabilizing algorithm for the st-order problem
- Complexity of Total {k}-Domination and Related Problems
- Distributed Computing - IWDC 2003
- Variations of \(Y\)-dominating functions on graphs
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457216)
