Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference24 articles.
1. logn-approximative NLCk-decomposition in O(n2k+1) time (extended abstract);Johansson,2001
2. A parametrized algorithm for matroid branch-width;Hliněný;SIAM J. Comput.,2005
3. Parameterized Complexity;Downey,1999
4. On the relationship between clique-width and tree-width;Corneil;SIAM J. Comput.,2005
5. Upper bounds to the clique width of graphs;Courcelle;Discrete Appl. Math.,2000
Cited by
316 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献