The following pages link to (Q3477932):
Displayed 29 items.
- Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Mesh permutation routing with locality (Q1199943) (← links)
- Broadcasting in butterfly and deBruijn networks (Q1339890) (← links)
- Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three (Q1372727) (← links)
- Cover-preserving embeddings of bipartite orders into Boolean lattices (Q1392208) (← links)
- Embedding ladders and caterpillars into the hypercube (Q1392524) (← links)
- Line broadcasting in cycles (Q1392536) (← links)
- Expansion of layouts of complete binary trees into grids (Q1414240) (← links)
- Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
- New results on edge-bandwidth (Q1885045) (← links)
- Degree-constrained spanners for multidimensional grids (Q1917351) (← links)
- Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans (Q1944166) (← links)
- Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 (Q1962071) (← links)
- A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
- Compact representation of graphs with bounded bandwidth or treedepth (Q2672250) (← links)
- Compression and expansion in graphs using overlays (Q3113505) (← links)
- Embedding some hierarchical caterpillars into hypercube (Q3439370) (← links)
- Cycle and Path Embedding on 5-ary N-cubes (Q3549291) (← links)
- Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ (Q4288206) (← links)
- On bandwidth, cutwidth, and quotient graphs (Q4359287) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- Wiener index via wirelength of an embedding (Q5063254) (← links)
- Broadcasting in butterfly and debruijn networks (Q5096794) (← links)
- Embedding complete binary trees into star networks (Q5096884) (← links)
- Efficient embeddings of grids into grids (Q5928873) (← links)
- Gossiping in vertex-disjoint paths mode in interconnection networks (Q6143984) (← links)
- The folded Petersen network: A new versatile multiprocessor interconnection topology (Q6143985) (← links)
- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs (Q6184365) (← links)