Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm.

Erik J. Hanashiro Henrique Mongelli Siang W. Song

Published in: WEA (2004)

Keyphrases

efficient implementation
vertex cover
active set
dynamic programming
worst case
search space
em algorithm
convergence rate
objective function
k means
learning algorithm
theoretical analysis
error bounds
lower bound
scheduling problem
computational complexity
model free
scoring function
optimal solution