scientific article; zbMATH DE number 1760009

MaRDI QIDQ4536933zbMATH OpenFDO

Authors Imrich Vrt'o

Publication date 25 June 2002

zbMATH Keywords

bisectioncongestioncutwidthembeddingmesh of trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Cutwidth of the r-dimensional mesh of d-ary trees
• On the Cutwidth and the Topological Bandwidth of a Tree
• Generalized diameters of the mesh of trees
• The cyclic cutwidth of trees
• Characterizations of \(k\)-cutwidth critical trees
• Cutwidth II: Algorithms for partial w-trees of bounded degree
• scientific article; zbMATH DE number 1472117
• Decompositions of critical trees with cutwidth k
• Algorithmic applications of tree-cut width
• Algorithmic applications of tree-cut width

Cited in

(2)

• Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
• Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536933)