Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.

Paul S. Bonsma Frederic Dorn

Published in: ESA (2008)

Keyphrases

spanning tree
tight bounds
minimum spanning tree
detection algorithm
learning algorithm
dynamic programming
preprocessing
undirected graph
computational complexity
worst case
np hard
objective function
high dimensional
particle swarm optimization
combinatorial optimization