On the computational complexity of upper total domination
From MaRDI portal
Publication:1421481
DOI10.1016/S0166-218X(03)00195-1zbMath1032.05096MaRDI QIDQ1421481
Publication date: 26 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (6)
The many facets of upper domination ⋮ Edge Weighting Functions on Dominating Sets ⋮ Edge weighting functions on semitotal dominating sets ⋮ Well-totally-dominated graphs ⋮ Algorithmic Aspects of Upper Domination: A Parameterised Perspective ⋮ Linear programming approach for various domination parameters
Cites Work
This page was built for publication: On the computational complexity of upper total domination