Cutwidth of triangular grids
From MaRDI portal
Publication:397153
DOI10.1016/J.DISC.2014.04.029zbMath1297.05206OpenAlexW2163300341MaRDI QIDQ397153
Lan Lin, Douglas B. West, Yanpei Liu
Publication date: 8 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.04.029
Related Items (2)
The minimum stretch spanning tree problem for typical graphs ⋮ New bounds on the edge-bandwidth of triangular grids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A degree sequence method for the cutwidth problem of graphs
- Optimal labelling of a product of two paths
- On the bandwidth of triangulated triangles
- The congestion of \(n\)-cube layout on a rectangular grid
- Cutwidth of ther-dimensional Mesh ofd-ary Trees
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- A polynomial algorithm for the min-cut linear arrangement of trees
- The bandwidth problem for graphs and matrices—a survey
- Cutwidth of iterated caterpillars
- Optimal numberings and isoperimetric problems on graphs
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
This page was built for publication: Cutwidth of triangular grids
