On the area of hypercube layouts.

DOI10.1016/S0020-0190(02)00218-1MaRDI QIDQ1853103zbMATH OpenFDO

Authors Lee Guan, Ronald I. Greenberg

Publication date 21 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Interconnection networksHypercubeChannel routingMincut linear arrangementOptimal linear arrangementVLSI layout areaWire density

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• scientific article; zbMATH DE number 2119684
• Graph Drawing
• Linear layouts of generalized hypercubes
• On embedding rectangular grids in hypercubes
• LINEAR LAYOUT OF GENERALIZED HYPERCUBES
• On the area of square lattice polygons.
• Covering a unit hypercube with hypercubes.
• On a covering problem in the hypercube
• On a covering problem in the hypercube
• On area-universal quadrangulations

Cites work

• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• Optimal Assignments of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• The congestion of \(n\)-cube layout on a rectangular grid

Cited in

(8)

• LINEAR LAYOUT OF GENERALIZED HYPERCUBES
• Layout of the cube-connected cycles without long wires
• VLSI layouts of complete graphs and star graphs
• Nearly optimal three dimensional layout of hypercube networks
• scientific article; zbMATH DE number 2119684 (Why is no real title available?)
• Graph Drawing
• Linear layouts of generalized hypercubes
• Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs

This page was built for publication: On the area of hypercube layouts.

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