Antibandwidth of Three-Dimensional Meshes
From MaRDI portal
Publication:3439580
DOI10.1016/j.endm.2007.01.023zbMath1291.05181MaRDI QIDQ3439580
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2007.01.023
05C35: Extremal problems in graph theory
05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Memetic algorithm for the antibandwidth maximization problem, GRASP with path relinking heuristics for the antibandwidth problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compressions and isoperimetric inequalities
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Hamiltonian powers in threshold and arborescent comparability graphs
- Matchings and paths in the cube
- A dynamic survey of graph labeling
- On Some Variants of the Bandwidth Minimization Problem
- Antibandwidth of Complete k-Ary Trees
- On the separation number of a graph
- Optimal Indexing of the Vertices of Graphs