Funder
Graz University of Technology
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference38 articles.
1. Arnborg, S., Lagergren, J., & Seese, D. (1991). Easy problems for tree-decomposable graphs. Journal of Algorithms, 12, 308–340.
2. Balas, E. (1999). New classes of efficiently solvable generalized traveling salesman problems. Annals of Operations Research, 86, 529–558.
3. Bandelt, H. J., & Dress, A. W. M. (1992). A canonical decomposition theory for metrics of a finite set. Advances in Mathematics, 92, 47–105.
4. Bertossi, A. A. (1981). The edge Hamiltonian path problem is NP-complete. Information Processing Letters, 13, 157–159.
5. Bodlaender, H. L. (1988). Some classes of graphs with bounded treewidth. Bulletin of the EATCS, 36, 116–126.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献