Login / Signup

A simplified correctness proof for a well-known algorithm computing strongly connected components.

Ingo Wegener
Published in: Inf. Process. Lett. (2002)
Keyphrases
  • dynamic programming
  • objective function
  • computational complexity
  • strongly connected components
  • segmentation algorithm
  • detection algorithm
  • randomly generated
  • np hard