Antibandwidth and cyclic antibandwidth of meshes and hypercubes

DOI10.1016/J.DISC.2007.12.058MaRDI QIDQ1025547zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• The Cyclic Antibandwidth Problem
• Antibandwidth of \(d\)-dimensional meshes
• Antibandwidth of three-dimensional meshes
• Antibandwidth of Three-Dimensional Meshes
• Antibandwidth and cyclic antibandwidth of Hamming graphs

Cites work

• scientific article; zbMATH DE number 3948287 (Why is no real title available?)
• scientific article; zbMATH DE number 3786792 (Why is no real title available?)
• scientific article; zbMATH DE number 638688 (Why is no real title available?)
• scientific article; zbMATH DE number 1045605 (Why is no real title available?)
• scientific article; zbMATH DE number 2016615 (Why is no real title available?)
• A dynamic survey of graph labeling
• A lower bound on the size of a complex generated by an antichain
• A note on Hamming spheres
• An Ordering on the Even Discrete Torus
• Hamiltonian powers in threshold and arborescent comparability graphs
• Odd and even Hamming spheres also have minimum boundary
• On Some Variants of the Bandwidth Minimization Problem
• On embeddings in cycles
• On the separation number of a graph
• Optimal numberings and isoperimetric problems on graphs
• Powers of Hamiltonian paths in interval graphs

Cited in

(25)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025547)