On complexity of a message-routing strategy for multicomputer systems

  • Hyeong-Ah Choi
  • Abdol-Hossein Esfahanian
Multiprocessor Systems And Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 484)


A natural communication problem in a multicomputer system, such as the hypercube, is that a processor (called the source) wants to send a message to a number of other processors (destinations). A message-routing paradigm for such a multidestination communication has been formulated as finding a subgraph called an optimal distance-preserving tree (ODPT). We prove that the problem of finding an ODPT is NP-hard both for the n-cube graph as well as for a graph whose maximum degree is at most three.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ChEH88]
    H.-A. Choi, A.-H. Esfahanian, and B. Houck, "Optimal Communication Trees with Application to Hypercube Multicomputers," Proc. 6th Intl. Conf. Theory and Applications of Graph Theory, Kalamazoo, MI, 1988.Google Scholar
  2. [GaJo79]
    M. R. Garey and D.S. Johnson, Computer and Intractability, W.H. Freeman and Company, San Francisco, 1979.Google Scholar
  3. [LaEN88]
    Y. Lan, L.M. Ni, and A.-H. Esfahanian, "Relay Approach Message Routing in Hypercube Multiprocessors," Proceedings of the 3rd International Conference on Supercomputing, pp. 174–183, May 1988.Google Scholar
  4. [Wong84]
    R.T. Wong, "A Dual Ascent Approach for Steiner Tree Problems on Directed Graphs," Mathematical Programming, Vol. 28, pp. 271–287, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Hyeong-Ah Choi
    • 1
  • Abdol-Hossein Esfahanian
    • 2
  1. 1.Department of Electrical Engineering and Computer ScienceGeorge Washington UniversityWashington, D.C.USA
  2. 2.Computer Science DepartmentMichigan State UniversityE. LansingUSA

Personalised recommendations