Author:
Henning Michael A.,Pradhan D.
Funder
University of Johannesburg
National Research Foundation
DST-SERB
Subject
General Computer Science,Theoretical Computer Science
Reference35 articles.
1. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
2. On the complexity landscape of the domination chain;Bazgan,2016
3. C. Bazgan, L. Brankovic, K. Casel, H. Fernau, K. Jansen, K.-M. Klein, M. Lampis, M. Liedloff, J. Monnot, V.Th. Paschos, Upper domination: complexity and approximation, in: IWOCA 2016, pp. 241–252.
4. The many facets of upper domination;Bazgan;Theor. Comput. Sci.,2018
5. Complexity of distance paired-domination problem in graphs;Chang;Theor. Comput. Sci.,2012
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献