Wirelength of hypercubes into certain trees
From MaRDI portal
Recommendations
- Wirelength of enhanced hypercubes into r-rooted complete binary trees
- Embedding of hypercubes into sibling trees
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Embeddings Between Hypercubes and Hypertrees
Cites work
- scientific article; zbMATH DE number 4064517 (Why is no real title available?)
- scientific article; zbMATH DE number 4064519 (Why is no real title available?)
- scientific article; zbMATH DE number 15360 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303526 (Why is no real title available?)
- scientific article; zbMATH DE number 2010366 (Why is no real title available?)
- scientific article; zbMATH DE number 2060183 (Why is no real title available?)
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An edge-isoperimetric problem for powers of the Petersen graph
- Complete binary trees in folded and enhanced cubes
- Dense sets and embedding binary trees into hypercubes
- Efficient Embeddings of Trees in Hypercubes
- Embedding complete trees into the hypercube
- Embedding ladders and caterpillars into the hypercube
- Embedding of binomial trees in hypercubes with link faults
- Embedding of cycles and wheels into arbitrary trees
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
- Exact wirelength of hypercubes on a grid
- Introduction to algorithms
- On embedding subclasses of height-balanced trees in hypercubes
- Optimal dynamic embeddings of complete binary trees into hypercubes
- Optimal embeddings of generalized ladders into hypercubes
- The congestion of \(n\)-cube layout on a rectangular grid
- The cyclic cutwidth of trees
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
Cited in
(17)- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures
- On linear layout of bicube and construction of optimal incomplete bicube
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Embedding augmented cube into certain trees and windmill graphs
- Wiener Index of Hypertree
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength
- Maximum incomplete recursive circulants in graph embeddings
- Wirelength of enhanced hypercubes into r-rooted complete binary trees
- Embedding Wheel - like Networks
- On some similarity of finite sets (and what we can say today about certain old problem)
- Exact wirelength of hypercube and enhanced hypercube layout on regular caterpillars
- Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength
- Embedding of hypercubes into sibling trees
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Exact wirelength of hypercube layout on \(k\)-cube necklace
- Improved bound for dilation of an embedding onto circulant networks
This page was built for publication: Wirelength of hypercubes into certain trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759856)
