Author:
Drange Pål Grønås,Dregi Markus Sortland,Lokshtanov Daniel,Sullivan Blair D.
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Brandes, U.: Social network algorithmics. ISAAC, Invited talk (2014)
2. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes. A Survey. SIAM, Philadelphia (1999)
3. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Applied Mathematics 154(13), 1824–1844 (2006)
4. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–176 (1996)
5. Cao, Y., Marx, D.: Chordal editing is fixed-parameter tractable. In: STACS. LIPIcs, vol. 25, pp. 214–225 (2014)
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献