Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
DOI10.1016/S0166-218X(99)00161-4zbMATH Open0949.05016OpenAlexW2054681864MaRDI QIDQ1962071FDOQ1962071
Publication date: 29 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00161-4
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Network design and communication in computer systems (68M10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
Cited In (28)
- Embedding augmented cube into certain trees and windmill graphs
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
- Conjectures on wirelength of hypercube into cylinder and torus
- Wiener Index of Hypertree
- Expansion of layouts of complete binary trees into grids
- A linear time algorithm for embedding hypercube into cylinder and torus
- Embedding of hypercubes into necklace, windmill and snake graphs
- Title not available (Why is that?)
- Square-root rule of two-dimensional bandwidth problem
- Title not available (Why is that?)
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees
- Embedding Wheel - like Networks
- Title not available (Why is that?)
- Embedding of the folded hypercubes into tori
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
- Characterization of the congestion lemma on layout computation
- Exact wirelength of hypercubes on a grid
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗
- Optimal Embedding of Locally Twisted Cubes into Grids
- Bothway embedding of circulant network into grid
- Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
- Embeddings of circulant networks
- Two models of two-dimensional bandwidth problems
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
- Wirelength of hypercubes into certain trees
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout
- Layout of embedding locally twisted cube into the extended theta mesh topology
Recommendations
This page was built for publication: Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962071)
