On complexity of a message-routing strategy for multicomputer systems

DOI10.1007/3-540-53832-1_41MaRDI QIDQ4028114zbMATH OpenFDO

Authors Hyeong-Ah Choi, Abdol-Hossein Esfahanian

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53832-1_41

zbMATH Keywords

message-routingmultidestination communicationNP-hardoptimal distance- preserving tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A message-routing strategy for multicomputer systems
• scientific article; zbMATH DE number 867692
• scientific article; zbMATH DE number 205350
• On the complexity of an optimal routing tree problem
• Multicasting in the hypercube, chord and binomial graphs

Cited in

(5)

• Distributed Multi-Destination Routing: The Constraints of Local Information
• A message-routing strategy for multicomputer systems
• Multicasting in the hypercube, chord and binomial graphs
• scientific article; zbMATH DE number 205350 (Why is no real title available?)
• scientific article; zbMATH DE number 867692 (Why is no real title available?)

This page was built for publication: On complexity of a message-routing strategy for multicomputer systems

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