Antibandwidth of three-dimensional meshes-Reference-Cited by-同舟云学术

Antibandwidth of three-dimensional meshes

Published:2010-02 Issue:3 Volume:310 Page:505-510
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Török L’ubomír,Vrt’o Imrich

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference20 articles.

1. Asymptotic determinantion of edge-bandwidth of multidimensional grids and Hamming graphs;Akhtar;SIAM Journal of Discrete Mathematics,2008

2. S.L. Bezrukov, V.P. Piotrowski, Shadows and isoperimetry in bipartite graphs, presented at SIAM Conference on Discrete Mathematics, Minneapolis, June 2000, (submitted for publication)

3. Compressions and isoperimetric inequalities;Bollobás;Journal of Combinatorial Theory A,1991

4. Matchings and paths in the cube;Bollobás;Discrete Applied Mathematics,1997

5. T. Calmoneri, A. Massini, L. Torok, I. Vrt’o, Antibandwidth of complete k-ary trees, Discrete Mathematics (2008), in press (doi:10.1016/j.disc.2008.10.019)

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

1. A note on maximum differential coloring of planar graphs;Journal of Discrete Algorithms;2014-11

2. Bandwidth of the product of paths of the same length;Discrete Applied Mathematics;2013-12

3. Antibandwidth and cyclic antibandwidth of Hamming graphs;Discrete Applied Mathematics;2013-07

4. Level-based heuristics and hill climbing for the antibandwidth maximization problem;Numerical Linear Algebra with Applications;2012-10-11

5. Bandwidth and pathwidth of three-dimensional grids;Discrete Mathematics;2011-06