OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

Ehab S. El-Mallah, Charles J. Colbourn

Research output: Contribution to journalArticle

1 Scopus citations

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 languageEnglish (US)
Pages (from-to)915-925
Number of pages11
JournalSIAM Journal on Computing
Volume14
Issue number4
DOIs
StatePublished - Jan 1 1985
Externally publishedYes

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