### Abstract

The optimum communication spanning tree problem is to locate a spanning tree which minimizes the sum of the lengths of the shortest routes between all pairs of vertices in a graph, weighted by traffic requirements. Although NP-complete in general, this problem has an efficient solution for series-parallel graphs when all requirements are equal. This problem was introduced by Hu, who gave an efficient solution for the restricted case when the network is complete and the distances are equal.

Original language | English (US) |
---|---|

Pages (from-to) | 915-925 |

Number of pages | 11 |

Journal | SIAM Journal on Computing |

Volume | 14 |

Issue number | 4 |

DOIs | |

State | Published - Jan 1 1985 |

Externally published | Yes |

### ASJC Scopus subject areas

- Computer Science(all)
- Mathematics(all)

## Fingerprint Dive into the research topics of 'OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.'. Together they form a unique fingerprint.

## Cite this

El-Mallah, E. S., & Colbourn, C. J. (1985). OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

*SIAM Journal on Computing*,*14*(4), 915-925. https://doi.org/10.1137/0214064