Author:
Heun Volker,Mayr Ernst W.
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference38 articles.
1. The Borsuk–Ulam theorem and bisection of necklaces;Alon;Proc. Am. Math. Soc.,1986
2. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Alg. Discrete Meth.,1987
3. Embedding ladders and caterpillars into the hypercube;Bezrukov;Discrete Appl. Math.,1998
4. Efficient embeddings of trees in hypercubes;Bhatt;SIAM J. Comput.,1992
5. A framework for solving VLSI graph layout problems;Bhatt;J. Comput. Syst. Sci.,1984
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献