Linear wirelength of folded hypercubes
From MaRDI portal
Publication:691637
DOI10.1007/S11786-011-0085-2zbMATH Open1254.05133OpenAlexW2048216748MaRDI QIDQ691637FDOQ691637
Authors: Indra Rajasingh, Micheal Arockiaraj 
Publication date: 3 December 2012
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-011-0085-2
Recommendations
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- A linear time algorithm for embedding hypercube into cylinder and torus
- Exact wirelength of hypercubes on a grid
- Conjectures on wirelength of hypercube into cylinder and torus
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Hypergraphs (05C65)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact wirelength of hypercubes on a grid
- Embedding ladders and caterpillars into the hypercube
- An edge-isoperimetric problem for powers of the Petersen graph
- The congestion of \(n\)-cube layout on a rectangular grid
- On reliability of the folded hypercubes
- Title not available (Why is that?)
Cited In (19)
- Node set optimization problem for complete Josephus cubes
- Conjectures on wirelength of hypercube into cylinder and torus
- Reliability measure of multiprocessor system based on enhanced hypercubes
- A note on minimum linear arrangement for BC graphs
- A linear time algorithm for embedding hypercube into cylinder and torus
- Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
- Minimum linear arrangement of the Cartesian product of optimal order graph and path
- Optimal embedding of locally twisted cubes into grids
- Embedding of the folded hypercubes into tori
- Linear layout of locally twisted cubes
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
- Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- Embedding of hypercubes into sibling trees
- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity
- On linear layout of bicube and construction of optimal incomplete bicube
This page was built for publication: Linear wirelength of folded hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691637)
