Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
From MaRDI portal
Publication:6094514
Abstract: Graph embeddings play a significant role in the design and analysis of parallel algorithms. It is a mapping of the topological structure of a guest graph G into a host graph H, which is represented as a one-to-one mapping from the vertex set of the guest graph to the vertex set of the host graph. In multiprocessing systems the interconnection networks enhance the efficient communication between the components in the system. Obtaining minimum wirelength in embedding problems is significant in the designing of network and simulating one architecture by another. In this paper, we determine the wirelength of embedding 3-ary n-cubes into cylinders and certain trees.
Recommendations
- Embedding of recursive circulants into certain necklace graphs
- Embedding complete multi-partite graphs into Cartesian product of paths and cycles
- Wirelength of embedding complete multipartite graphs into certain graphs
- Embedding of hypercubes into necklace, windmill and snake graphs
- Graph embedding and interconnection networks
Cites work
- 3-extra connectivity of 3-ary \(n\)-cube networks
- A necessary condition on minimal cube numberings
- A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- An edge-isoperimetric problem for powers of the Petersen graph
- An Isoperimetric Inequality on the Discrete Torus
- Assignment of Numbers to Vertices
- Bandwidth Minimization: An approximation algorithm for caterpillars
- Clique partitions, graph compression and speeding-up algorithms
- Efficient embeddings of grids into grids
- Embedding complete trees into the hypercube
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding ladders and caterpillars into the hypercube
- Embedding meshes into crossed cubes
- Embedding of cycles and wheels into arbitrary trees
- Embedding of hypercubes into necklace, windmill and snake graphs
- Embedding of tori and grids into twisted cubes
- Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Exact wirelength of hypercubes on a grid
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
- Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
- H-supermagic labelings for firecrackers, banana trees and flowers
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303526 (Why is no real title available?)
- Lee distance and topological properties of k-ary n-cubes
- Lexicographical Ordering of k-Subsets of a Set
- Multicast-Based Testing and Thermal-Aware Test Scheduling for 3D ICs with a Stacked Network-on-Chip
- New infinite family of regular edge-isoperimetric graphs
- On embedding subclasses of height-balanced trees in hypercubes
- Operations of interlaced trees and graceful trees
- Optimal Assignments of Numbers to Vertices
- Optimal embeddings of generalized ladders into hypercubes
- Path embedding in star graphs
- Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- The congestion of \(n\)-cube layout on a rectangular grid
- The edge-isoperimetric problem for discrete tori
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
Cited in
(5)- Embedding algorithm of spined cube into grid structure and its wirelength computation
- Minimum Linear Arrangement of Generalized Sierpinski Graphs
- Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing
- Embedding of extended Sierpinski networks \(S^{++}(k, m)\) into certain trees
- Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
This page was built for publication: Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094514)
