Talk:Kosaraju's algorithm

Computing Stub‑class

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks. Stub This article has been rated as Stub-class on Wikipedia's content assessment scale. ??? This article has not yet received a rating on the project's importance scale. This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the |auto= parameter.

Confusion

Latest comment: 16 years ago2 comments2 people in discussion

"Aho, Hopcroft and Ullman credit it to an unpublished paper from 1978 by S. Rao Kosaraju" -- but Aho, Hopcroft and Ullman, as referenced in the article, was (apparently) published in 1974... — Matt Crypto 09:24, 16 February 2009 (UTC)Reply

As far as I know, Kosaraju's algorithm first appeared in print in M. Sharir, "A strong-connectivity algorithm and its application in data flow analysis", Computer and Mathematics with Applications, vol 7 nr 1, pp. 67--72, 1981. Snudehygel (talk) 22:23, 8 May 2009 (UTC)Reply