Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees

DOI10.3233/fi-222149arXiv2204.12079OpenAlexW4381382086MaRDI QIDQ6094514

Publication date: 14 September 2023

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.12079

zbMATH Keywords

embedding congestion wirelength edge isoperimetric problem 3-ary $n$-cube

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

Unnamed Item
Unnamed Item
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Embedding of hypercubes into necklace, windmill and snake graphs
A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary $n$-cube
Embedding of tori and grids into twisted cubes
Embedding paths and cycles in 3-ary $n$-cubes with faulty nodes and links
Path embedding in star graphs
On embedding subclasses of height-balanced trees in hypercubes
Exact wirelength of hypercubes on a grid
General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
Embedding ladders and caterpillars into the hypercube
An edge-isoperimetric problem for powers of the Petersen graph
The edge-isoperimetric problem for discrete tori
New infinite family of regular edge-isoperimetric graphs
Operations of interlaced trees and graceful trees
Graphs, networks and algorithms. Based on the translation of the 3rd German edition by Tilla Schade in collaboration with the author
Clique partitions, graph compression and speeding-up algorithms
Wirelength of $1$-fault Hamiltonian graphs into wheels and fans
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
The congestion of $n$-cube layout on a rectangular grid
Embedding meshes into crossed cubes
3-extra connectivity of 3-ary $n$-cube networks
Super edge-magic strength of fire crackers, banana trees and unicyclic graphs
Multicast-Based Testing and Thermal-Aware Test Scheduling for 3D ICs with a Stacked Network-on-Chip
The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
Lexicographical Ordering of k-Subsets of a Set
Bandwidth Minimization: An approximation algorithm for caterpillars
Assignment of Numbers to Vertices
Lee distance and topological properties of k-ary n-cubes
$H$-supermagic labelings for firecrackers, banana trees and flowers
Embedding of cycles and wheels into arbitrary trees
An Isoperimetric Inequality on the Discrete Torus
Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
A necessary condition on minimal cube numberings
Optimal Assignments of Numbers to Vertices
Efficient embeddings of grids into grids
Optimal embeddings of generalized ladders into hypercubes
Embedding complete trees into the hypercube

This page was built for publication: Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees