scientific article; zbMATH DE number 867692

MaRDI QIDQ4873808zbMATH OpenFDO

Authors Hyeong-Ah Choi, Abdol-Hossein Esfahanian, Bradley C. Houck

Publication date 22 April 1996

zbMATH Keywords

hypercube multicomputersmessagemulticomputer systemNP-hardoptimal communication treerouting strategy

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A message-routing strategy for multicomputer systems
• scientific article; zbMATH DE number 139789
• Multicast algorithms for hypercube multiprocessors
• Optimum Communication Spanning Trees in Series-Parallel Networks

Cited in

(13)

• A minimax assignment problem in treelike communication networks
• On the communication structures of hyper-ring and hypercube multicomputers
• Optimal multicast trees in communication systems with channel capacities and channel reliabilities
• Optimal core selection for multicast tree routing in hypercube networks
• Efficient Internode Communications in Reconfigurable Binary Trees
• scientific article; zbMATH DE number 3878344 (Why is no real title available?)
• scientific article; zbMATH DE number 4141826 (Why is no real title available?)
• scientific article; zbMATH DE number 139789 (Why is no real title available?)
• Multicasting in the hypercube, chord and binomial graphs
• scientific article; zbMATH DE number 205350 (Why is no real title available?)
• A Class of Optimal Structures for Node Computations in Message Passing Algorithms
• Optimization problems in multicast tree construction
• Multicast algorithms for hypercube multiprocessors

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