scientific article; zbMATH DE number 4147467

zbMATH Open0699.68017MaRDI QIDQ3477932FDOQ3477932

Authors: Burkhard Monien, Hal Sudborough 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• Embedding hypercubes and related networks into mesh-connected processor arrays
• Incomplete hypercubes: Embeddings of tree-related networks
• Embedding complete multipartite graphs into certain trees
• Hypercube emulation of interconnection networks topologies
• Graph embedding and interconnection networks

zbMATH Keywords

simulationembeddinginterconnection network

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99) Theory of operating systems (68N25)

Cited In (34)

• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Compression and expansion in graphs using overlays
• On embedding 2-dimensional toroidal grids into de Bruijn graphs with clocked congestion one
• The folded Petersen network: A new versatile multiprocessor interconnection topology
• Embedding complete binary trees into star networks
• On bandwidth, cutwidth, and quotient graphs
• Expansion of layouts of complete binary trees into grids
• Line broadcasting in cycles
• Alternative evaluation functions for the cyclic bandwidth sum problem
• A linear time algorithm for embedding hypercube into cylinder and torus
• Broadcasting in butterfly and deBruijn networks
• Embedding some hierarchical caterpillars into hypercube
• Broadcasting in butterfly and deBruijn networks (extended abstract)
• Cycle and Path Embedding on 5-ary N-cubes
• Title not available (Why is that?)
• New results on edge-bandwidth
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Gossiping in vertex-disjoint paths mode in interconnection networks
• Cover-preserving embeddings of bipartite orders into Boolean lattices
• The complexity of systolic dissemination of information in interconnection networks
• Wiener index via wirelength of an embedding
• Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$
• Title not available (Why is that?)
• Embedding ladders and caterpillars into the hypercube
• Degree-constrained spanners for multidimensional grids
• Compact representation of graphs with bounded bandwidth or treedepth
• Mesh permutation routing with locality
• Efficient embeddings of grids into grids
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• Title not available (Why is that?)
• Minimal cutwidth linear arrangements of abelian Cayley graphs
• Cartesian products of graphs as spanning subgraphs of de Bruijn graphs
• Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
• Calibrating an Embedded Protocol on an Asynchronous System

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477932)