Author:
Antony Dhanyamol,Garchar Jay,Pal Sagartanu,Sandeep R. B.,Sen Sagnik,Subashini R.
Publisher
Springer International Publishing
Reference17 articles.
1. Aravind, N.R., Sandeep, R.B., Sivadasan, N.: Dichotomy results on the hardness of H-free edge modification problems. SIAM J. Discre. Math. 31(1), 542–561 (2017)
2. Cai, L., Cai, Y.: Incompressibility of $$H$$-free edge modification problems. Algorithmica 71(3), 731–757 (2014). https://doi.org/10.1007/s00453-014-9937-x
3. Cai, Y.: Polynomial kernelisation of H-free edge modification problems. M .Phil. thesis, Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China (2012)
4. Cao, Y., Chen, J.: Cluster editing: Kernelization based on edge cuts. Algorithmica 64(1), 152–169 (2012)
5. Lecture Notes in Computer Science;Y Cao,2020
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献