Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoret. Comput. Sci. 10, 111–121 (1980)
2. Harary, F.: Graph Theory. Addison-Wesley, Reading, Mass (1969)
3. Kramer, M.R., van Leeuwen, J.: The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata, F.P. (ed.) Advances in Computing Research, vol. 2, pp. 129–146. JAI Press, Greenwich, Conn (1984)
4. Lynch, J.F.: The equivalence of theorem proving and the interconnection problem. ACM SIGDA Newsletter 5, 31–36 (1975)
5. Perković, L., Reed, B.: An improved algorithm for finding tree decompositions of small width. Internat. J. Foundat. Comput. Sci. 11, 365–371 (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献