Funder
Hong Kong Research Grants Council
National Natural Science Foundation of China
Subject
General Computer Science,Theoretical Computer Science
Reference34 articles.
1. Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi, Feedback vertex set inspired kernel for chordal vertex deletion, in: Klein [26], pp. 1383–1398, https://doi.org/10.1137/1.9781611974782.90.
2. Some classes of perfect graphs;Berge,1967
3. Dominating sets for split and bipartite graphs;Bertossi;Inform. Process. Lett.,1984
4. Largest chordal and interval subgraphs faster than 2n;Bliznets;Algorithmica,2016
5. On the complexity of the maximum cut problem;Bodlaender;Nordic J. Comput.,2000
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献