Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,318 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Computer science
List of NP-complete problems
Spanning 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
M. Hundley
,
Roman V. Yampolskiy
Midwest Artificial Intelligence and Cognitive…
2017
Corpus ID: 27508426
2009
2009
Selected Topics in Algorithms 2009 NP-completeness of Minimum Fundamental Cycle Basis Problem
K. Mehlhorn
2009
Corpus ID: 118731405
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…
Expand
1982
1982
On the complexity of the one-terminal network design problem
N. Megiddo
Operations Research Letters
1982
Corpus ID: 18634789
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)
ACCEPT & CONTINUE