OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

Ehab S. El-Mallah, Charles Colbourn

Research output: Contribution to journalArticle

1 Citation (Scopus)

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
StatePublished - Nov 1985
Externally publishedYes

Fingerprint

Spanning tree
Efficient Solution
Series
Communication
Series-parallel Graph
Requirements
Weighted Graph
NP-complete problem
Traffic
Minimise

ASJC Scopus subject areas

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

Cite this

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

In: SIAM Journal on Computing, Vol. 14, No. 4, 11.1985, p. 915-925.

Research output: Contribution to journalArticle

@article{57941582ac3d4e5fad388e778fde37a0,
title = "OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.",
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.",
author = "El-Mallah, {Ehab S.} and Charles Colbourn",
year = "1985",
month = "11",
language = "English (US)",
volume = "14",
pages = "915--925",
journal = "SIAM Journal on Computing",
issn = "0097-5397",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "4",

}

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 -