Antibandwidth and cyclic antibandwidth of meshes and hypercubes

DOI10.1016/j.disc.2007.12.058zbMath1209.05216OpenAlexW2037252568MaRDI QIDQ1025547

Ondrej Sýkora, Heiko Schröder, Imrich Vrt'o, L'ubomír Török, Andre Raspaud

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.058

zbMATH Keywords

hypercubemeshantibandwidthtoroidal meshcyclic antibandwidth

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (21)

Separation numbers of trees ⋮ Combining intensification and diversification strategies in VNS. An application to the vertex separation problem ⋮ Tabu search for the cyclic bandwidth problem ⋮ Branch and bound for the cutwidth minimization problem ⋮ Variable neighborhood search for the vertex separation problem ⋮ The maximum \(k\)-differential coloring problem ⋮ Strong SDP based bounds on the cutwidth of a graph ⋮ Memetic algorithm for the antibandwidth maximization problem ⋮ A special antidilation problem for meshes and Hamming graphs ⋮ Antibandwidth and cyclic antibandwidth of Hamming graphs ⋮ A note on maximum differential coloring of planar graphs ⋮ Antibandwidth of three-dimensional meshes ⋮ Scatter search for the cutwidth minimization problem ⋮ Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem ⋮ A note on computational approaches for the antibandwidth problem ⋮ On explicit formulas for bandwidth and antibandwidth of hypercubes ⋮ Level-based heuristics and hill climbing for the antibandwidth maximization problem ⋮ Antibandwidth of complete \(k\)-ary trees ⋮ Antibandwidth and Cyclic Antibandwidth of Hamming Graphs ⋮ Antibandwidth of Three-Dimensional Meshes ⋮ A general variable neighborhood search for the cyclic antibandwidth problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Odd and even Hamming spheres also have minimum boundary
• A lower bound on the size of a complex generated by an antichain
• Hamiltonian powers in threshold and arborescent comparability graphs
• A dynamic survey of graph labeling
• On embeddings in cycles
• A note on Hamming spheres
• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph
• Powers of Hamiltonian paths in interval graphs
• An Ordering on the Even Discrete Torus
• Optimal numberings and isoperimetric problems on graphs

This page was built for publication: Antibandwidth and cyclic antibandwidth of meshes and hypercubes