Node set optimization problem for complete Josephus cubes

DOI10.1007/S10878-019-00443-9MaRDI QIDQ2279757zbMATH OpenOpenAlexWikidataFDO

Authors Micheal Arockiaraj, Jessie Abraham, Arul Jeya Shalini

Publication date 13 December 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00443-9

zbMATH Keywords

complete Josephus cubeembeddinglayoutoptimal set

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Programming involving graphs or networks (90C35)

Recommendations

• The Josephus cube: A novel interconnection network
• Exact wirelength of hypercube layout on k-cube necklace
• The Josephus Cube: analysis of routing and fault tolerance
• Nearly optimal three dimensional layout of hypercube networks
• Incomplete hypercubes: Embeddings of tree-related networks

Cites work

• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An edge-isoperimetric problem for powers of the Petersen graph
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding of hypercubes into necklace, windmill and snake graphs
• Embedding of the folded hypercubes into tori
• Embedding signed graphs in the line
• Embeddings of circulant networks
• Exact wirelength of hypercubes on a grid
• scientific article; zbMATH DE number 176780 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Introduction to algorithms
• Linear layout of locally twisted cubes
• Linear wirelength of folded hypercubes
• Mapping the genome
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Minimum wirelength of hypercubes into \(n\)-dimensional grid networks
• Optimal Assignments of Numbers to Vertices
• Optimal Numberings of an N \times N Array
• Single Machine Job Sequencing with Precedence Constraints
• The congestion of \(n\)-cube layout on a rectangular grid
• The Josephus cube: A novel interconnection network
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans

Cited in

(9)

• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
• Optimal wirelength of balanced complete multipartite graphs onto Cartesian product of \{path, cycle\} and trees
• Minimum linear arrangement of the Cartesian product of optimal order graph and path
• On linear layout of bicube and construction of optimal incomplete bicube
• Embedding hierarchical cubic networks into k-rooted complete binary trees for minimum wirelength
• Connectivity and diagnosability of the complete Josephus cube networks under h-extra fault-tolerant model
• Vertex-independent spanning trees in complete Josephus cubes
• Embedding crossed cube into diverse product graphs and tree-derived architectures
• Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem

This page was built for publication: Node set optimization problem for complete Josephus cubes

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