Exact and Parameterized Algorithms for Max Internal Spanning Tree.

Henning Fernau Serge Gaspers Daniel Raible

Published in: WG (2009)

Keyphrases

spanning tree
minimum spanning tree
learning algorithm
significant improvement
computational cost
brute force
exact and approximate
computational complexity
worst case
computationally efficient
multimedia
simulated annealing
optimization problems
particle swarm optimization
minimum cost
greedy heuristic