Algorithmic and complexity aspects of problems related to total restrained domination for graphs
From MaRDI portal
Publication:6181337
DOI10.1007/s10878-023-01090-xOpenAlexW4388775460MaRDI QIDQ6181337
Cai-Xia Wang, Shou-Jun Xu, Yu Yang
Publication date: 22 January 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01090-x
NP-completeAPX-completetotal domination numbertotal restrained domination numberlinear algorithmrestrained domination number
Cites Work
- Unnamed Item
- NP-completeness and APX-completeness of restrained domination in graphs
- A survey of selected recent results on total domination in graphs
- Optimization, approximation, and complexity classes
- Parallel recognition of series-parallel graphs
- The complexity of domination problems in circle graphs
- Restrained domination in graphs
- Combinatorial algorithms on a class of graphs
- Domination in some subclasses of bipartite graphs
- Total restrained domination numbers of trees
- A threshold of ln n for approximating set cover
- On total restrained domination in graphs
- On the Algorithmic Complexity of Total Domination
- Total domination in graphs
- The Complexity of Multiterminal Cuts
- A REVIEW OF TREE CONVEX SETS TEST
- Dividing a Graph into Triconnected Components
- Reducibility among Combinatorial Problems
- Trees with restrained domination and total restrained domination numbers
This page was built for publication: Algorithmic and complexity aspects of problems related to total restrained domination for graphs
