Author:
Sæther Sigve Hortemo,Vatshelle Martin
Funder
Research Council of Norway
Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
2. Clique-width is NP-complete;Fellows;SIAM J. Discrete Math.,2009
3. Call routing and the ratcatcher;Seymour;Combinatorica,1994
4. Approximating rank-width and clique-width quickly;Oum;ACM Trans. Algorithms,2008
5. New width parameters of graphs;Vatshelle,2012
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献