Optimum Communications Spanning Trees
Hu, T. C.
Abstract
| Given a set of nodes N_i(i=1,2....n) which may represent cities
and a set of requirements which may represent the number of
telephone calls between N_i and N_j, the problem is to build a
spanning tree connecting these n nodes such that the total cost
of communication of the spanning tree is a minimum among all
spanning tree.
|
Keywords
tree
spanning tree
Notes
Related Papers
Bibtex
@ARTICLE {hu_span74,
author = {T. C. Hu},
title = {Optimum Communication Spanning Trees},
journal = {SIAM Journal of Computing},
volume = {3},
number = {3},
pages = {188 -- 195},
year = {1974}
}