The congestion of \(n\)-cube layout on a rectangular grid
From MaRDI portal
Publication:1970694
DOI10.1016/S0012-365X(99)00162-4zbMath0953.68115OpenAlexW1983901430MaRDI QIDQ1970694
M. Röttger, Sergei L. Bezrukov, J. D. Chavez, U.-P. Schroeder, Lawrence H. Harper
Publication date: 22 June 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00162-4
Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10)
Related Items (43)
Minimal congestion trees ⋮ Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network ⋮ Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees ⋮ Embeddings of circulant networks ⋮ Layout of embedding locally twisted cube into the extended theta mesh topology ⋮ Cutwidth of triangular grids ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Minimum average congestion of enhanced and augmented hypercubes into complete binary trees ⋮ Isoperimetric Problem and Meta-fibonacci Sequences ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Embedding Wheel - like Networks ⋮ A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout ⋮ On the monotonicity of games generated by symmetric submodular functions. ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Optimal Embedding of Locally Twisted Cubes into Grids ⋮ On the optimal layout of balanced complete multipartite graphs into grids and tree related structures ⋮ Routing and wavelength assignment for exchanged hypercubes in linear array optical networks ⋮ LINEAR LAYOUT OF GENERALIZED HYPERCUBES ⋮ Routing and wavelength assignment for hypercube in array-based WDM optical networks ⋮ Bothway embedding of circulant network into grid ⋮ Edge-pancyclicity and path-embeddability of bijective connection graphs ⋮ On tree congestion of graphs ⋮ Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees ⋮ Linear wirelength of folded hypercubes ⋮ Efficient embeddings of grids into grids ⋮ Wirelength of hypercubes into certain trees ⋮ Minimum congestion spanning trees in planar graphs ⋮ Linear layout of locally twisted cubes ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Maximum incomplete recursive circulants in graph embeddings ⋮ Node set optimization problem for complete Josephus cubes ⋮ Linear layout of directed grid graph ⋮ Embedding of recursive circulants into certain necklace graphs ⋮ Bounds on isoperimetric values of trees ⋮ The cyclic cutwidth of trees ⋮ Exact wirelength of hypercubes on a grid ⋮ Embedding algorithm of spined cube into grid structure and its wirelength computation ⋮ Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees ⋮ On spanning tree congestion of graphs ⋮ On spanning tree congestion ⋮ Square-root rule of two-dimensional bandwidth problem ⋮ On the area of hypercube layouts.
This page was built for publication: The congestion of \(n\)-cube layout on a rectangular grid
