Algorithmic aspects of upper paired-domination in graphs

DOI10.1016/j.tcs.2019.10.045zbMath1436.68242WikidataQ126834989 ScholiaQ126834989MaRDI QIDQ2283034

Michael A. Henning, Dinabandhu Pradhan

Publication date: 27 December 2019

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

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

zbMATH Keywords

polynomial-time algorithm; NP-complete; domination; APX-complete; paired domination; upper paired domination

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

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

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

68W25: Approximation algorithms