scientific article; zbMATH DE number 512930

MaRDI QIDQ4281645zbMATH OpenFDO

Authors Sajal K. Das, Aisheng Mao

Publication date 20 June 1994

zbMATH Keywords

bipartite graphscombinatorial networkscongestion- free routingembeddingfull binary treeshypercubeinterconnection networksmesh

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 140108
• Recursive circulants and their embeddings among hypercubes
• Multiple network embeddings into hypercubes

Cited in

(6)

• Recursive circulants and their embeddings among hypercubes
• A finite automata approach to modeling the cross product of interconnection networks.
• scientific article; zbMATH DE number 3883643 (Why is no real title available?)
• scientific article; zbMATH DE number 140108 (Why is no real title available?)
• scientific article; zbMATH DE number 1302053 (Why is no real title available?)
• Network Comparison: Embeddings and Interiors

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 Q4281645)