Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
From MaRDI portal
Publication:1962071
DOI10.1016/S0166-218X(99)00161-4zbMath0949.05016MaRDI QIDQ1962071
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
05C05: Trees
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C10: Planar graphs; geometric and topological aspects of graph theory
68W35: Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, Embedding Wheel - like Networks, Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees, Embeddings of circulant networks, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, Embedding of hypercubes into necklace, windmill and snake graphs, Bothway embedding of circulant network into grid, Minimum average congestion of enhanced and augmented hypercubes into complete binary trees, Two models of two-dimensional bandwidth problems, Exact wirelength of hypercubes on a grid, Expansion of layouts of complete binary trees into grids, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, Wirelength of hypercubes into certain trees, A linear time algorithm for embedding hypercube into cylinder and torus, Characterization of the congestion lemma on layout computation, A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout, Conjectures on wirelength of hypercube into cylinder and torus, Layout of embedding locally twisted cube into the extended theta mesh topology, Embedding of the folded hypercubes into tori, Optimal Embedding of Locally Twisted Cubes into Grids, Square-root rule of two-dimensional bandwidth problem, Wiener Index of Hypertree
Cites Work
