Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees.

Ran Duan Haoqing He Tianyi Zhang

Published in: CoRR (2017)

Keyphrases

spanning tree
worst case
minimum spanning tree
optimization problems
orders of magnitude
edge disjoint
data structure
computational complexity
theoretical analysis
times faster
data mining
learning algorithm
computational cost
computationally efficient
approximate solutions
minimum spanning trees