10 4 these parallel paths are proven of minimum length within a small additive constant and the running time of our algorithm is bounded by o n2