Embedding algorithm of spined cube into grid structure and its wirelength computation
Authors:
- Micheal ArockiarajMAMicheal Arockiaraj
- Arul Jeya ShaliniASArul Jeya Shalini
- J. Nancy DelailaJDJ. Nancy Delaila
- 1 February 2022
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 905, 69-86
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Minimum wirelength of hypercubes into n-dimensional grid networksInformation Processing Letters, 2012
- The spined cube: A new hypercube variant with smaller diameterInformation Processing Letters, 2011
- Linear Wirelength of Folded HypercubesMathematics in Computer Science, 2011
- Exact wirelength of hypercubes on a gridDiscrete Applied Mathematics, 2009
- Maximum number of edges joining vertices on a cubeInformation Processing Letters, 2003
- The congestion of n-cube layout on a rectangular gridDiscrete Mathematics, 2000
- Incomplete hypercubes: Algorithms and embeddingsThe Journal of Supercomputing, 1994
- Topological properties of hypercubesIEEE Transactions on Computers, 1988
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- Optimal Assignments of Numbers to VerticesJournal of the Society for Industrial and Applied Mathematics, 1964