Differentiating-total domination: approximation and hardness results
type: Item
instance of: scholarly article
title: Differentiating-total domination: approximation and hardness results
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2021-06-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7362190
zbMATH Keywords: domination
zbMATH Keywords: total domination
zbMATH Keywords: differentiating-total domination
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: \textsf{NP}-complete
zbMATH Keywords: \textsf{APX}-complete
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.05.021
OpenAlex ID: W3164356876
cites work: Some APX-completeness results for cubic graphs
cites work: A REVIEW OF TREE CONVEX SETS TEST
cites work: On locating and differetiating-total domination in trees
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: Domination in convex and chordal bipartite graphs
cites work: Analytical approach to parallel repetition
cites work: Q4368729
cites work: Q4368728
cites work: Locating and total dominating sets in trees
cites work: A survey of selected recent results on total domination in graphs
cites work: Total Domination in Graphs
cites work: Q4077442
cites work: Q4198056
cites work: Reducibility among Combinatorial Problems
cites work: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
cites work: Bounds on the differentiating-total domination number of a tree
cites work: Domination in some subclasses of bipartite graphs
cites work: A note on the complexity of locating-total domination in graphs
DOI: 10.1016/J.TCS.2021.05.021
description: scientific article; zbMATH DE number 7362190