Shortest total path length spanning tree
In computer science, 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 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?
primaryTopic
Shortest total path length spanning tree
In computer science, 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 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?
has abstract
In computer science, the short ...... d v in T is no greater than B?
@en
Wikipage page ID
31,277,685
Wikipage revision ID
695,748,755
comment
In computer science, the short ...... d v in T is no greater than B?
@en
label
Shortest total path length spanning tree
@en