Login / Signup
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three.
Paul S. Bonsma
Published in:
SIAM J. Discret. Math. (2008)
Keyphrases
</>
spanning tree
edge disjoint
minimum cost
minimum spanning tree
minimum spanning trees
undirected graph
minimum weight
weighted graph
minimum total cost
depth first search
approximation algorithms
edge weights
computational complexity
data points
social network analysis