Embedding ladders and caterpillars into the hypercube-Reference-Cited by-同舟云学术

Embedding ladders and caterpillars into the hypercube

Published:1998-03 Issue:1-3 Volume:83 Page:21-29
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Bezrukov Sergei,Monien Burkhard,Unger Walter,Wechsung Gerd

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference18 articles.

1. S.L. Bezrukov, B. Monien, W. Unger, G. Wechsung, Dense subsets and their use in embedding problems, Technical Report, University of Paderborn, to appear.

2. Efficient embedding of trees in hypercube;Bhatt;SIAM J. Comput.,1990

3. Spanning caterpillars of the hypercube;Dvor̆ák,1995

4. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979

5. Bandwidth minimization: an approximation algorithm for caterpillars;Haralambides;Math. Systems Theory,1991

Cited by 34 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimization of layout for embedding half hypercube into conventional tree architectures;Concurrency and Computation: Practice and Experience;2024-02-27

2. Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees;Fundamenta Informaticae;2023-06-19

3. Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees;Fundamenta Informaticae;2021-01-15

4. Layout of embedding locally twisted cube into the extended theta mesh topology;Electronic Notes in Discrete Mathematics;2017-12

5. Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube;Journal of Graph Theory;2017-08-09