Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Computer scienceList of NP-complete problemsSpanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Shortest Total Path Length Spanning Tree via Wisdom of Artificial Crowds Algorithm
2009
2009
Selected Topics in Algorithms 2009 NP-completeness of Minimum Fundamental Cycle Basis Problem
Let G = (V,E) be an undirected graph. For a spanning tree T of G and vertices u and v, let dT (u,v) be the distance between u and… 
1982
1982
On the complexity of the one-terminal network design problem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)