Algorithmic aspects of k-tuple total domination in graphs
From MaRDI portal
Recommendations
- On the algorithmic complexity of \(k\)-tuple total domination
- \(k\)-tuple domination in graphs
- \(k\)-tuple total domination in graphs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Hardness results of global total \(k\)-domination problem in graphs
Cites work
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- A threshold of ln n for approximating set cover
- Approximation hardness of dominating set problems in bounded degree graphs
- Characterizations of strongly chordal graphs
- Classes of bipartite graphs related to chordal graphs
- Dually Chordal Graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- Incidence matrices and interval graphs
- On the Algorithmic Complexity of Total Domination
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- \(k\)-tuple domination in graphs
- \(k\)-tuple total domination in cross products of graphs
- \(k\)-tuple total domination in graphs
Cited in
(28)- Algorithmic aspect of \(k\)-tuple domination in graphs.
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
- New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
- Total 2-domination of proper interval graphs
- Algorithmic aspects of open neighborhood location-domination in graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- \(k\)-tuple and \(k\)-tuple total dominations on web graphs
- \(k\)-tuple total domination in graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- On the algorithmic complexity of \(k\)-tuple total domination
- On the domination of triangulated discs
- Minimum 2-tuple dominating set of an interval graph
- Domination parameters with number 2: interrelations and algorithmic consequences
- Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
- Algorithmic aspects of total k-subdomination in graphs
- Complexity of total outer-connected domination problem in graphs
- Hardness results of global total \(k\)-domination problem in graphs
- Minimum 2-tuple dominating set of permutation graphs
- Hardness results of global total \(k\)-domination problem in graphs
- k-Efficient domination: Algorithmic perspective
- An efficient algorithm for distance total domination in block graphs
- On upper bounds for total k-domination number via the probabilistic method
- Liar's dominating set problem on unit disk graphs
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Algorithmic aspects of total vertex-edge domination in graphs
- Global total \(k\)-domination: approximation and hardness results
This page was built for publication: Algorithmic aspects of \(k\)-tuple total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456136)
