scientific article
From MaRDI portal
Publication:3477932
zbMath0699.68017MaRDI QIDQ3477932
Burkhard Monien, Hal Sudborough
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25) Theory of software (68N99)
Related Items (29)
New results on edge-bandwidth ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ Wiener index via wirelength of an embedding ⋮ Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$ ⋮ Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three ⋮ Degree-constrained spanners for multidimensional grids ⋮ Compact representation of graphs with bounded bandwidth or treedepth ⋮ Broadcasting in butterfly and debruijn networks ⋮ Embedding complete binary trees into star networks ⋮ Cover-preserving embeddings of bipartite orders into Boolean lattices ⋮ Embedding ladders and caterpillars into the hypercube ⋮ Line broadcasting in cycles ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ The folded Petersen network: A new versatile multiprocessor interconnection topology ⋮ Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans ⋮ Cartesian products of graphs as spanning subgraphs of de Bruijn graphs ⋮ Expansion of layouts of complete binary trees into grids ⋮ Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 ⋮ On bandwidth, cutwidth, and quotient graphs ⋮ Cycle and Path Embedding on 5-ary N-cubes ⋮ The complexity of systolic dissemination of information in interconnection networks ⋮ Minimal cutwidth linear arrangements of abelian Cayley graphs ⋮ Mesh permutation routing with locality ⋮ Efficient embeddings of grids into grids ⋮ A linear time algorithm for embedding hypercube into cylinder and torus ⋮ Compression and expansion in graphs using overlays ⋮ Embedding some hierarchical caterpillars into hypercube
This page was built for publication:
