Author:
Kloks Ton,Kratsch Dieter,Müller Haiko
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference34 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. The bandwidth of caterpillars with hairs of length 1 and 2;Assmann;SIAM J. Algebraic Discrete Methods,1981
3. G. Blache, M. Karpinski, and, J. Wirtgen, On approximation intractability of the bandwidth problem, in, Electronic Colloquium on Computational Complexity, 1998, Report No, 14.
4. H. Bodlaender, M. R. Fellows, and M. T. Hallet, Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy, inProceedings of the 26th Annual Symposium on the Theory of Computation, 1994, pp. 449–458.
5. Graph Theory with Applications;Bondy,1976
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献