LINEAR LAYOUT OF GENERALIZED HYPERCUBES

DOI10.1142/S0129054103001637zbMath1099.68516OpenAlexW2154286377MaRDI QIDQ5696897

Koji Nakano

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103001637

zbMATH Keywords

bisection widthlinear layouttotal edge lengthgeneralized hypercubescut widthmaximum subgraphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

A branch-and-bound algorithm for the minimum cut linear arrangement problem ⋮ Brushing without capacity restrictions ⋮ Cleaning a network with brushes ⋮ The carving-width of generalized hypercubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological properties of supercube
• On minimizing width in linear layouts
• The congestion of \(n\)-cube layout on a rectangular grid
• Preserving Proximity in Arrays
• Preserving average proximity in arrays
• THE ISOPERIMETRIC NUMBER OF d–DIMENSIONAL k–ARY ARRAYS
• Optimal Assignments of Numbers to Vertices

This page was built for publication: LINEAR LAYOUT OF GENERALIZED HYPERCUBES