Weighted upper domination number
References (10)
- et al.
On the computational complexity of upper fractional domination
Discrete Applied Mathematics
(1990) - et al.
Contributions to the theory of domination, independence and irredundance in graphs
Discrete Mathematics
(1981) - et al.
Chordal graphs and upper irredundance, upper domination and independence
Discrete Mathematics
(1990) - et al.
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
(2008) - et al.
A dichotomy for upper domination in monogenic classes
There are more references available in the full text version of this article.
Cited by (8)
(In)approximability of maximum minimal FVS
2022, Journal of Computer and System SciencesDomination in Graphs: Core Concepts
2023, Springer Monographs in Mathematics(In)approximability of maximum minimal FVS
2020, Leibniz International Proceedings in Informatics, LIPIcs(In)approximability of maximum minimal FVS
2020, arXivWeighted upper edge cover: Complexity and approximability
2020, Journal of Graph Algorithms and ApplicationsFormalization of the domination chain with weighted parameters
2019, Leibniz International Proceedings in Informatics, LIPIcs
- 1
Postdoctoral researcher, Université Paris-Dauphine.
© 2017 Elsevier B.V. All rights reserved.