Algorithmic aspects of k-tuple total domination in graphs
DOI10.1016/J.IPL.2012.07.010zbMATH Open1248.68222OpenAlexW2028613978MaRDI QIDQ456136FDOQ456136
Authors: D. Pradhan 
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.010
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
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- A threshold of ln n for approximating set cover
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Some APX-completeness results for cubic graphs
- Incidence matrices and interval graphs
- On the Algorithmic Complexity of Total Domination
- Title not available (Why is that?)
- \(k\)-tuple total domination in graphs
- Characterizations of strongly chordal graphs
- Dually Chordal Graphs
- \(k\)-tuple domination in graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- Classes of bipartite graphs related to chordal graphs
- \(k\)-tuple total domination in cross products of graphs
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
Cited In (28)
- On the algorithmic complexity of \(k\)-tuple total domination
- Hardness results of global total \(k\)-domination problem in graphs
- On upper bounds for total k-domination number via the probabilistic method
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs
- Global total \(k\)-domination: approximation and hardness results
- Minimum 2-tuple dominating set of permutation graphs
- \(k\)-tuple total domination in graphs
- Algorithmic aspect of \(k\)-tuple domination in graphs.
- On the domination of triangulated discs
- Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs
- Total 2-domination of proper interval graphs
- Computing a minimum outer-connected dominating set for the class of chordal graphs
- Hardness results of global total \(k\)-domination problem in graphs
- An efficient algorithm for distance total domination in block graphs
- Algorithmic aspects of total vertex-edge domination in graphs
- Algorithmic aspects of total k-subdomination in graphs
- Algorithmic aspects of open neighborhood location-domination in graphs
- Upper bounds on the \(k\)-tuple domination number and \(k\)-tuple total domination number of a graph
- Domination parameters with number 2: interrelations and algorithmic consequences
- \(k\)-tuple and \(k\)-tuple total dominations on web graphs
- On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
- Improved algorithms for \(k\)-domination and total \(k\)-domination in proper interval graphs
- k-Efficient domination: Algorithmic perspective
- Complexity of total outer-connected domination problem in graphs
- Minimum 2-tuple dominating set of an interval graph
- 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
- Liar's dominating set problem on unit disk graphs
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)
