Fig. 4From: A fast exact sequential algorithm for the partial digest problemRunning times of the BBd, BBb and BBb2 algorithms for the RD. The line for BBd algorithm is not complete because the running time is greater than the maximum value of y-axis or 24Â hBack to article page