VLSI layouts of complete graphs and star graphs
From MaRDI portal
(Redirected from Publication:293402)
Recommendations
Cites work
- scientific article; zbMATH DE number 3900683 (Why is no real title available?)
- scientific article; zbMATH DE number 52113 (Why is no real title available?)
- A class of recursive interconnection networks: architectural characteristics and hardware cost
- On VLSI layouts of the star graph and related networks
- On the genus of star graphs
- Transposition networks as a class of fault-tolerant robust networks
Cited in
(9)- An area-maximum edge length trade-off for VSLI layout
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
- A framework for solving VLSI graph layout problems
- On the problem of determining which \((n, k)\)-star graphs are Cayley graphs
- On VLSI layouts of the star graph and related networks
- scientific article; zbMATH DE number 88981 (Why is no real title available?)
- Single-row transformation of complete graphs
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- 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)