Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree.

Paul S. Bonsma Frederic Dorn

Published in: ACM Trans. Algorithms (2011)

Keyphrases

spanning tree
tight bounds
dynamic programming
learning algorithm
computational complexity
detection algorithm
preprocessing
minimum spanning tree
minimum weight
optimal solution
search space
undirected graph
particle swarm optimization
minimum cost
ant colony optimization
np hard
special case
objective function