Optimal Parallel Time Bounds for the Maximum Clique Problem on Intervals.

Published in: Inf. Process. Lett. (1992)

Keyphrases

worst case
dynamic programming
upper bound
tight bounds
optimal solution
lower bound
error bounds
parallel implementation
asymptotically optimal
massively parallel
branch and bound algorithm
efficiently computable
lp norm
optimal cost
optimal strategy
optimal control
database
search algorithm
data sets