Restrained and Total Restrained Domination in Cographs
X Chen, MY Sohn - Algorithmic Aspects in Information and Management …, 2021 - Springer
X Chen, MY Sohn
Algorithmic Aspects in Information and Management: 15th International …, 2021•SpringerLet γ _ r (G) γ r (G) and γ _ tr (G) γ tr (G) denote the restrained domination number and total
restrained domination number of G, respectively. The minimum total restrained domination
problem is to find a total restrained dominating set of minimum cardinality. In this paper, we
correct a minor error in Pandey et al. 5 and design a linear-time algorithm for finding the
restrained domination number of cographs. Furthermore, we propose a linear-time algorithm
to solve the minimum total restrained domination problem in cographs.
restrained domination number of G, respectively. The minimum total restrained domination
problem is to find a total restrained dominating set of minimum cardinality. In this paper, we
correct a minor error in Pandey et al. 5 and design a linear-time algorithm for finding the
restrained domination number of cographs. Furthermore, we propose a linear-time algorithm
to solve the minimum total restrained domination problem in cographs.
Abstract
Let and denote the restrained domination number and total restrained domination number of G, respectively. The minimum total restrained domination problem is to find a total restrained dominating set of minimum cardinality. In this paper, we correct a minor error in Pandey et al. [5] and design a linear-time algorithm for finding the restrained domination number of cographs. Furthermore, we propose a linear-time algorithm to solve the minimum total restrained domination problem in cographs.
Springer
Showing the best result for this search. See all results