NPTEL Video Course : NOC:Parallel Algorithms

Lecture 36 - Ordered DFS is P-complete for NC-reductions