Pages that link to "Item:Q1970694"
From MaRDI portal
The following pages link to The congestion of \(n\)-cube layout on a rectangular grid (Q1970694):
Displaying 44 items.
- Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees (Q327683) (← links)
- Embeddings of circulant networks (Q358657) (← links)
- Cutwidth of triangular grids (Q397153) (← links)
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
- Routing and wavelength assignment for exchanged hypercubes in linear array optical networks (Q477625) (← links)
- Bothway embedding of circulant network into grid (Q491606) (← links)
- Minimum average congestion of enhanced and augmented hypercubes into complete binary trees (Q628321) (← links)
- Routing and wavelength assignment for hypercube in array-based WDM optical networks (Q666013) (← links)
- Linear wirelength of folded hypercubes (Q691637) (← links)
- On tree congestion of graphs (Q952638) (← links)
- Minimum congestion spanning trees in planar graphs (Q966018) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- Exact wirelength of hypercubes on a grid (Q1028121) (← links)
- On spanning tree congestion of graphs (Q1043936) (← links)
- On spanning tree congestion (Q1044004) (← links)
- The cyclic cutwidth of trees (Q1270769) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
- Wirelength of hypercubes into certain trees (Q1759856) (← links)
- On the area of hypercube layouts. (Q1853103) (← links)
- Minimal congestion trees (Q1877665) (← links)
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans (Q1944166) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Embedding algorithm of spined cube into grid structure and its wirelength computation (Q2072078) (← links)
- A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout (Q2201764) (← links)
- On the optimal layout of balanced complete multipartite graphs into grids and tree related structures (Q2208343) (← links)
- Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
- Layout of embedding locally twisted cube into the extended theta mesh topology (Q2413386) (← links)
- Edge-pancyclicity and path-embeddability of bijective connection graphs (Q2466094) (← links)
- Linear layout of directed grid graph (Q2516509) (← links)
- Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
- Optimal wavelength assignment in the implementation of parallel algorithms with ternary \(n\)-cube communication pattern on mesh optical network (Q2637352) (← links)
- Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
- Optimal Embedding of Locally Twisted Cubes into Grids (Q2971629) (← links)
- Square-root rule of two-dimensional bandwidth problem (Q3117546) (← links)
- Isoperimetric Problem and Meta-fibonacci Sequences (Q3511309) (← links)
- Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees (Q4989174) (← links)
- LINEAR LAYOUT OF GENERALIZED HYPERCUBES (Q5696897) (← links)
- Linear layout of locally twisted cubes (Q5737850) (← links)
- Efficient embeddings of grids into grids (Q5928873) (← links)
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees (Q6094514) (← links)
- Embedding Wheel - like Networks (Q6187747) (← links)
- Embedding augmented cube into certain trees and windmill graphs (Q6554734) (← links)
