Shortest total path length spanning tree

Computer science

Computer science or computing science is the study of the theoretical foundations of information and computation and of practical techniques for their implementation and application in computer systems...

, the shortest total path length spanning tree is, given an n-node undirected graph G(V, E); positive integer B, does there exist a spanning tree

Spanning tree

Spanning tree can refer to:* Spanning tree , a tree which contains every vertex of a more general graph* Spanning tree protocol, a protocol for finding spanning trees in bridged networks...

T(V, F) of G such that the sum over all pairs of nodes u and v of the length of the path between u and v in T is no greater than B?

The source of this article is wikipedia, the free encyclopedia. The text of this article is licensed under the GFDL.