Antibandwidth of Three-Dimensional Meshes
From MaRDI portal
Recommendations
- Antibandwidth of three-dimensional meshes
- Antibandwidth of \(d\)-dimensional meshes
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Bandwidth and pathwidth of three-dimensional grids
- Bandwidth of pyramidal meshes
- On the bandwidth of convex triangulation meshes
- Bandwidth-based mesh adaptation in multiple dimensions
- Aspects of three‐dimensional constrained Delaunay meshing
Cites work
- scientific article; zbMATH DE number 638688 (Why is no real title available?)
- scientific article; zbMATH DE number 2016615 (Why is no real title available?)
- A dynamic survey of graph labeling
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
- Antibandwidth of Complete k-Ary Trees
- Compressions and isoperimetric inequalities
- Hamiltonian powers in threshold and arborescent comparability graphs
- Matchings and paths in the cube
- On Some Variants of the Bandwidth Minimization Problem
- On the separation number of a graph
- Optimal Indexing of the Vertices of Graphs
- Powers of Hamiltonian paths in interval graphs
Cited in
(7)- Bandwidth and pathwidth of three-dimensional grids
- GRASP with path relinking heuristics for the antibandwidth problem
- Antibandwidth of \(d\)-dimensional meshes
- Tabu search for the cyclic bandwidth problem
- Memetic algorithm for the antibandwidth maximization problem
- Antibandwidth of three-dimensional meshes
- Antibandwidth and cyclic antibandwidth of meshes and hypercubes
This page was built for publication: Antibandwidth of Three-Dimensional Meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439580)