Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1

DOI10.1016/S0166-218X(99)00161-4MaRDI QIDQ1962071zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

zbMATH Keywords

embeddingscomplete binary treesquare gridextended gridtotal vertex-congestion

Mathematics Subject Classification ID

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)

Recommendations

• Publication:4938676
• Optimal two-sided embeddings of complete binary trees in rectangular grids
• scientific article; zbMATH DE number 219230
• Efficient embeddings of grids into grids
• Expansion of layouts of complete binary trees into grids

Cites work

• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 4147467 (Why is no real title available?)
• scientific article; zbMATH DE number 139790 (Why is no real title available?)
• scientific article; zbMATH DE number 219230 (Why is no real title available?)
• EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗
• Efficient Embeddings of Binary Trees in VLSI Arrays

Cited in

(29)

• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding augmented cube into certain trees and windmill graphs
• Conjectures on wirelength of hypercube into cylinder and torus
• Expansion of layouts of complete binary trees into grids
• Wiener Index of Hypertree
• A linear time algorithm for embedding hypercube into cylinder and torus
• Embedding of hypercubes into necklace, windmill and snake graphs
• scientific article; zbMATH DE number 139790 (Why is no real title available?)
• Square-root rule of two-dimensional bandwidth problem
• Optimal embedding of locally twisted cubes into grids
• scientific article; zbMATH DE number 219230 (Why is no real title available?)
• Wirelength of enhanced hypercubes into r-rooted complete binary trees
• scientific article; zbMATH DE number 1405694 (Why is no real title available?)
• Embedding Wheel - like Networks
• 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
• Bothway embedding of circulant network into grid
• EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗
• Embeddings of circulant networks
• Embedding hypercubes into torus and Cartesian product of paths and/or cycles for minimizing wirelength
• 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
• Optimal two-sided embeddings of complete binary trees in rectangular grids

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)