NPTEL Video Course : NOC:Parallel Algorithms

Lecture 37 - Max Flow is P-complete for NC-reductions