Complexity of distance paired-domination problem in graphs

DOI10.1016/j.tcs.2012.08.024zbMath1250.68119MaRDI QIDQ1758170

Xianqiang Yang

Publication date: 8 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.024

zbMATH Keywords

approximation algorithm; NP-complete; APX-complete; strongly chordal graph; undirected path graph; distance \(k\)-dominating set; distance \(k\)-paired-dominating set

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms