Algorithmic aspect of \(k\)-tuple domination in graphs.
From MaRDI portal
Publication:1860929
DOI10.11650/twjm/1500558307zbMath1047.05032OpenAlexW4248071256MaRDI QIDQ1860929
Chung-Shou Liao, Gerard Jennhwa Chang
Publication date: 2002
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500558307
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (37)
The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs ⋮ A polyhedral view to a generalization of multiple domination ⋮ On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs ⋮ \(k\)-tuple total domination in cross products of graphs ⋮ On the algorithmic complexity of \(k\)-tuple total domination ⋮ On the \(k\)-tuple domination of generalized de Brujin and Kautz digraphs ⋮ The multiple domination and limited packing problems in graphs ⋮ On the complexity of the labeled domination problem in graphs ⋮ Liar's domination in graphs: complexity and algorithm ⋮ On disjoint maximal independent sets in graphs ⋮ Rainbow domination and related problems on strongly chordal graphs ⋮ Algorithmic aspects of the \(k\)-domination problem in graphs ⋮ The upper bound on \(k\)-tuple domination numbers of graphs ⋮ Limited packing and multiple domination problems: polynomial time reductions ⋮ Capacitated Domination Problem ⋮ An optimal algorithm to find minimum k-hop dominating set of interval graphs ⋮ Variations of \(Y\)-dominating functions on graphs ⋮ Restricted domination parameters in graphs ⋮ A generalised upper bound for the \(k\)-tuple domination number ⋮ Capacitated domination problem ⋮ Hardness results, approximation and exact algorithms for liar's domination problem in graphs ⋮ \(k\)-tuple total domination in graphs ⋮ Hardness results and approximation algorithm for total liar's domination in graphs ⋮ Paired versus double domination in \(K_{1,r}\)-free graphs ⋮ The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ Minimum 2-tuple dominating set of permutation graphs ⋮ A note on the \(k\)-tuple total domination number of a graph ⋮ \(k\)-tuple domination in graphs ⋮ Multiple Domination ⋮ Unnamed Item ⋮ Hardness results and approximation algorithms of \(k\)-tuple domination in graphs ⋮ An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs ⋮ Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs ⋮ Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs ⋮ Upper bounds for the domination numbers of graphs using Turán's theorem and Lovász local lemma ⋮ On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs
This page was built for publication: Algorithmic aspect of \(k\)-tuple domination in graphs.
