Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes

DOI10.1007/3-540-60618-1_80OpenAlexW1518606313MaRDI QIDQ6122229

Imrich Vrt'o, Ondrej Sýkora, José D. P. Rolim

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60618-1_80

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-isoperimetric inequalities in the grid
• Some simplified NP-complete graph problems
• A note on the edges of the n-cube
• 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
• Assignment of Numbers to Vertices
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes