Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs

DOI10.1016/0020-0190(86)90122-5zbMath0606.68068OpenAlexW1986286271MaRDI QIDQ1084869

Wei-Kuan Shih, Ferng-Ching Lin

Publication date: 1986

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

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/155684/1/03.pdf

zbMATH Keywords

VLSIgraph layoutlong edgeswire area lower bound

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Unnamed Item
• A framework for solving VLSI graph layout problems
• An asymptotically optimal layout for the shuffle-exchange graph
• New lower bound techniques for VLSI
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs