Exact and Parameterized Algorithms for Max Internal Spanning Tree.

Daniel Binkele-Raible Henning Fernau Serge Gaspers Mathieu Liedloff

Published in: Algorithmica (2013)

Keyphrases

spanning tree
computationally efficient
optimization problems
significant improvement
brute force
data structure
computational cost
learning algorithm
multimedia
computational complexity
edge weights
minimum spanning tree
running times