Author:
Fomin Fedor V.,Villanger Yngve
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference38 articles.
1. S. Arnborg, D. G. Corneil and A. Proskurowski: Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods 8 (1987), 277–284.
2. C. Beeri, R. Fagin, D. Maier and M. Yannakakis: On the desirability of acyclic database schemes, J. ACM 30 (1983), 479–513.
3. A. Berry, J. P. Bordat and O. Cogis: Generating all the minimal separators of a graph., Int. J. Found. Comput. Sci. 11 (2000), 397–403.
4. A. Björklund, T. Husfeldt, P. Kaski and M. Koivisto: The travelling salesman problem in bounded degree graphs, in: Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008), vol. 5125 of Lecture Notes in Comput. Sci., Springer, 2008, 198–209.
5. A. Björklund, T. Husfeldt, P. Kaski and M. Koivisto: Trimmed Moebius inversion and graphs of bounded degree, Theory Comput. Syst. 47 (2010), 637–654.
Cited by
64 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献