Publisher
Springer International Publishing
Reference25 articles.
1. Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Feedback vertex set inspired kernel for chordal vertex deletion. In: Proceedings of 28th SODA, pp. 1383–1398. SIAM (2017).
https://doi.org/10.1137/1.9781611974782.90
2. Berge, C.: Sur le couplage maximum d’un graphe. Comptes rendus hebdomadaires des séances de l’Académie des sciences 247, 258–259 (1958)
3. Bodlaender, H.L.: A partial
$$k$$
-arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209(1–2), 1–45 (1998).
https://doi.org/10.1016/S0304-3975(97)00228-4
4. Lecture Notes in Computer Science;HL Bodlaender,2009
5. Bodlaender, H.L., van Dijk, T.C.: A cubic kernel for feedback vertex set and loop cutset. Theory Comput. Syst. 46(3), 566–597 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献