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.
CITATION STYLE
Choi, H. A., & Esfahanian, A. H. (1991). On complexity of a message-routing strategy for multicomputer systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 484 LNCS, pp. 170–181). Springer Verlag. https://doi.org/10.1007/3-540-53832-1_41
Mendeley helps you to discover research relevant for your work.