Efficient parallel shortest path algorithms for k-chordal graphs

Presents parallel NC algorithms for all pair shortest path problem with optimal processor time product and single source shortest path problem with near optimal processor time product in k-chordal graphs. The algorithm for all pair problem runs in O(log/sup 2/ n) time with O(n/sup 2//log/sup 2/ n) processors. The single source problem runs with O(n) processors in O(log/sup 2/ n) time. In both cases the author assumes CRCW PRAM model of computation.<
>