Bandwidth and pathwidth of three-dimensional grids
From MaRDI portal
Publication:534058
DOI10.1016/J.DISC.2011.02.019zbMATH Open1223.05142OpenAlexW2050587029MaRDI QIDQ534058FDOQ534058
Authors: Yota Otachi, Ryohei Suda 
Publication date: 10 May 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.02.019
Recommendations
- scientific article; zbMATH DE number 3963886
- Antibandwidth of three-dimensional meshes
- Antibandwidth of Three-Dimensional Meshes
- Bandwidth of pyramidal meshes
- On the bandwidth of convex triangulation meshes
- Edge-bandwidth of the triangular grid
- Bandwidth-based mesh adaptation in multiple dimensions
- Bandwidth reduction in rectangular grids
- Cubicity and bandwidth
- On the bandwidth of triangulated triangles
Cites Work
- A Simple Proof of the Karakhanyan–Riordan Theorem on the Even Discrete Torus
- An Ordering on the Even Discrete Torus
- Title not available (Why is that?)
- Optimal numberings and isoperimetric problems on graphs
- Compressions and isoperimetric inequalities
- Graph minors. I. Excluding a forest
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Optimal labelling of a product of two paths
- Security number of grid-like graphs
- Title not available (Why is that?)
- The bandwidth problem for graphs and matrices—a survey
- Recognizing Cartesian products in linear time
- Lower bounds on the pathwidth of some grid-like graphs
- The treewidth and pathwidth of hypercubes
- On explicit formulas for bandwidth and antibandwidth of hypercubes
- Antibandwidth of three-dimensional meshes
- Isoperimetric inequalities and fractional set systems
- Treewidth and logical definability of graph products
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
- On the edge-bandwidth of graph products
- Title not available (Why is that?)
- Optimal Indexing of the Vertices of Graphs
- Edge-bandwidth of grids and tori
Cited In (10)
- Grid minors in damaged grids
- Edge-bandwidth of the triangular grid
- Antibandwidth of Three-Dimensional Meshes
- Title not available (Why is that?)
- Enumerating Hamiltonian cycles
- Lower bounds on the pathwidth of some grid-like graphs
- Catching an infinitely fast robber on a grid
- Structure of graphs with locally restricted crossings
- GRASP and path relinking for the matrix bandwidth minimization.
- Treewidth of Cartesian products of highly connected graphs
This page was built for publication: Bandwidth and pathwidth of three-dimensional grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534058)
