Efficient embeddings of grids into grids-Reference-Cited by-同舟云学术

Efficient embeddings of grids into grids

Published:2001-02 Issue:1-2 Volume:108 Page:143-173
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Röttger M.,Schroeder U.-P.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference23 articles.

1. Edge isoperimetric theorems for integer point arrays;Ahlswede;Appl. Math. Lett.,1995

2. On embedding rectangular grids in square grids;Aleliunas;IEEE Trans. Comput.,1982

3. S.L. Bezrukov, An isoperimetric problem for Manhatten lattices, in: Proceedings of the International Conference on Sets, Graphs and Numbers, 1991, pp. 2–3.

4. S.L. Bezrukov, Isoperimetric problems in discrete spaces, in: P. Frankl, Z. Füredi, G. Katona, D. Miklos (Eds.), Extremal Problems for Finite Sets, Bolyai Society Mathematical Studies, Vol. 3, János Bolyai Mathematical Society, Budapest, 1994, pp. 59–91.

5. The congestion of n-cube layout on a rectangular grid;Bezrukov;Discrete Math.,2000

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

1. Embedding Wheel - like Networks;Iranian Journal of Mathematical Sciences and Informatics;2023-10-01

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

3. MinLA of $$(K_9-C_9)^n$$ and its optimal layout into certain trees;The Journal of Supercomputing;2023-03-06

4. Embedding Wheel-like Networks;IRAN J MATH SCI INFO;2023

5. A Linear Time Algorithm for Embedding Christmas Trees into Certain Trees;Parallel Processing Letters;2015-12