Differentiating-total domination: approximation and hardness results
From MaRDI portal
Publication:2034786
DOI10.1016/j.tcs.2021.05.021OpenAlexW3164356876MaRDI QIDQ2034786
Publication date: 23 June 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.05.021
polynomial-time algorithmdominationtotal domination\textsf{APX}-complete\textsf{NP}-completedifferentiating-total domination
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the differentiating-total domination number of a tree
- Domination in convex and chordal bipartite graphs
- Approximation hardness of dominating set problems in bounded degree graphs
- A survey of selected recent results on total domination in graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Some APX-completeness results for cubic graphs
- Domination in some subclasses of bipartite graphs
- A note on the complexity of locating-total domination in graphs
- Locating and total dominating sets in trees
- On locating and differetiating-total domination in trees
- A REVIEW OF TREE CONVEX SETS TEST
- Total Domination in Graphs
- Reducibility among Combinatorial Problems
- Analytical approach to parallel repetition
This page was built for publication: Differentiating-total domination: approximation and hardness results
