Cutwidth of triangular grids
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 857606 (Why is no real title available?)
- A degree sequence method for the cutwidth problem of graphs
- A polynomial algorithm for recognizing bounded cutwidth in hypergraphs
- A polynomial algorithm for the min-cut linear arrangement of trees
- Cutwidth of iterated caterpillars
- Cutwidth of the \(r\)-dimensional mesh of \(d\)-ary trees
- Graph theory
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- On the bandwidth of triangulated triangles
- Optimal labelling of a product of two paths
- Optimal numberings and isoperimetric problems on graphs
- The bandwidth problem for graphs and matrices—a survey
- The congestion of \(n\)-cube layout on a rectangular grid
Cited in
(5)
This page was built for publication: Cutwidth of triangular grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q397153)