OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

Ehab S. El-Mallah; Charles J. Colbourn

doi:10.1137/0214064

OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

Ehab S. El-Mallah, Charles J. Colbourn

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	915-925
Number of pages	11
Journal	SIAM Journal on Computing
Volume	14
Issue number	4
DOIs	https://doi.org/10.1137/0214064
State	Published - Jan 1 1985
Externally published	Yes

ASJC Scopus subject areas

Computer Science(all)
Mathematics(all)

Access to Document

10.1137/0214064

Cite this

@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 Colbourn, {Charles J.}",

year = "1985",

month = jan,

day = "1",

doi = "10.1137/0214064",

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

PY - 1985/1/1

Y1 - 1985/1/1

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

U2 - 10.1137/0214064

DO - 10.1137/0214064

M3 - Article

AN - SCOPUS:0022161310

SN - 0097-5397

VL - 14

SP - 915

EP - 925

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 4

ER -

OPTIMUM COMMUNICATION SPANNING TREES IN SERIES-PARALLEL NETWORKS.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this