Linear wirelength of folded hypercubes

DOI10.1007/s11786-011-0085-2zbMath1254.05133OpenAlexW2048216748MaRDI QIDQ691637

Micheal Arockiaraj, Indra Rajasingh

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

zbMATH Keywords

embeddingcongestionwirelengthedge isoperimetric problemfolded hypercube

Mathematics Subject Classification ID

Hypergraphs (05C65) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, On linear layout of bicube and construction of optimal incomplete bicube, An O(log(N)) Algorithm View: Reliability Evaluation of Folded-crossed Hypercube in Terms of h-extra Edge-connectivity, A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout, Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes, Optimal Embedding of Locally Twisted Cubes into Grids, Reliability measure of multiprocessor system based on enhanced hypercubes, Embedding of hypercubes into sibling trees, A note on minimum linear arrangement for BC graphs, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, Linear layout of locally twisted cubes, Node set optimization problem for complete Josephus cubes, Embedding of the folded hypercubes into tori, Embedding algorithm of spined cube into grid structure and its wirelength computation

Cites Work

• On reliability of the folded hypercubes
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item