VLSI layouts of complete graphs and star graphs

DOI10.1016/S0020-0190(98)00133-1zbMATH Open1339.68216OpenAlexW2155555720MaRDI QIDQ293402FDOQ293402

Chi-Hsiang Yeh, Behrooz Parhami

Publication date: 9 June 2016

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

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001331?np=y

Recommendations

• On VLSI layouts of the star graph and related networks
• On the area of hypercube layouts.
• An optimal emulator and VLSI layout for complete binary trees
• On the Optimal Layout of Planar Graphs with Fixed Boundary
• An area-maximum edge length trade-off for VSLI layout

zbMATH Keywords

parallel processingstar graphscomplete graphsVLSI layout

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On VLSI layouts of the star graph and related networks
• A class of recursive interconnection networks: architectural characteristics and hardware cost
• On the genus of star graphs
• Transposition networks as a class of fault-tolerant robust networks

Cited In (9)

• On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
• On VLSI layouts of the star graph and related networks
• Single-row transformation of complete graphs
• Title not available (Why is that?)
• Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
• An area-maximum edge length trade-off for VSLI layout
• A framework for solving VLSI graph layout problems
• Title not available (Why is that?)
• Two models of two-dimensional bandwidth problems

This page was built for publication: VLSI layouts of complete graphs and star graphs

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