### 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 |

State | Published - Nov 1985 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Computational Theory and Mathematics
- Applied Mathematics
- Theoretical Computer Science

### Cite this

*SIAM Journal on Computing*,

*14*(4), 915-925.

**OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.** / El-Mallah, Ehab S.; Colbourn, Charles.

Research output: Contribution to journal › Article

*SIAM Journal on Computing*, vol. 14, no. 4, pp. 915-925.

}

TY - JOUR

T1 - OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

AU - El-Mallah, Ehab S.

AU - Colbourn, Charles

PY - 1985/11

Y1 - 1985/11

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022161310&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022161310&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0022161310

VL - 14

SP - 915

EP - 925

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 4

ER -