Author:
Belmonte Rémy,Vatshelle Martin
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems;Bui-Xuan;Theoretical Computer Science,2013
2. Algorithms for vertex partitioning problems on partial k-trees;Telle;SIAM Journal on Discrete Mathematics,1997
3. Linear time solvable optimization problems on graphs of bounded clique-width;Courcelle;Theory of Computing Systems,2000
4. Some simplified NP-complete graph problems;Garey;Theoretical Computer Science,1976
5. On the restriction of some NP-complete graph problems to permutation graphs;Brandstädt,1985
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献