Cutwidth of ther-dimensional Mesh ofd-ary Trees

DOI10.1051/ita:2000128zbMath0976.05059OpenAlexW2131744324MaRDI QIDQ2729628

Imrich Vrt'o

Publication date: 8 January 2002

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/221959

zbMATH Keywords

treesmeshcutwidth

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Mathematical problems of computer architecture (68M07)

Related Items (3)

Decomposability of a class of \(k\)-cutwidth critical graphs ⋮ Cutwidth of triangular grids ⋮ Exact wirelength of hypercubes on a grid

Cites Work

• Unnamed Item
• A polynomial algorithm for the min-cut linear arrangement of trees
• Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
• Cutwidth of the de Bruijn graph

This page was built for publication: Cutwidth of ther-dimensional Mesh ofd-ary Trees