Author:
Gupta Sushmita,Jain Pallavi,Petety Aditya,Singh Sagar
Publisher
Springer International Publishing
Reference29 articles.
1. Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)
2. B-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications (2001)
3. Banerjee, S., Mathew, R., Panolan, F.: ‘target set selection’ on graphs of bounded vertex cover number (2018)
4. Bannach, M., Skambath, M., Tantau, T.: Kernelizing the hitting set problem in linear sequential and constant parallel time. In: 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) (2020)
5. Bannach, M., Tantau, T.: Computing hitting set kernels by ac 0-circuits. Theor. Comput. Syst. 1–26 (2019)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献