Talk:Kosaraju's algorithm: Difference between revisions

Revision as of 22:23, 8 May 2009

Revision as of 13:08, 10 August 2009

Line 5:

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. [[User:Snudehygel|Snudehygel]] ([[User talk:Snudehygel|talk]]) 22:23, 8 May 2009 (UTC)

:The source of confusion appears to be the following statement in Cormen et al. algoritms book (I have the 1990 edition of CLRS at hand). The chapter notes on "Elementary Graph Algorithms" says:

::"The algorithm [...] is adapted from Aho, Hopcroft and Ullman [5], who credit it to S.R. Kosaraju and M. Sharir."

:In the references section of CLRS, we find the following entry:

::[4] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley 1974.

::[5] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.

:I would suggest that someone goes to a library and checks what is actually stated in reference [5]. (Sigh. I suppose that errors which cannot be verified with the aid of an internet search engine will actually never be fixed on wikipedia.) [[Special:Contributions/134.176.28.77|134.176.28.77]] ([[User talk:134.176.28.77|talk]]) 13:08, 10 August 2009 (UTC)