Brief Announcement: A Parallel (Delta, Gamma)-Stepping Algorithm for the Constrained Shortest Path Problem

We design a parallel algorithm for the Constrained Shortest Path (CSP) problem. The CSP problem is known to be NP-hard and there exists a pseudo-polynomial time sequential algorithm that solves it. To design the parallel algorithm, we extend the techniques used in the design of the Delta-stepping algorithm for the single-source shortest paths problem.