Author:
Meesum S. M.,Misra Pranabendu,Saurabh Saket
Publisher
Springer International Publishing
Reference18 articles.
1. Akbari, S., Cameron, P.J., Khosrovshahi, G.B.: Ranks and signatures of adjacency matrices (2004)
2. Burzyn, P., Bonomo, F., Durán, G.: Np-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824–1844 (2006)
3. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)
4. Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. In: STACS, pp. 214–225 (2014)
5. Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. ACM Transactions on Algorithms (TALG) 11(3), 21 (2015)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献