Jump to content

Talk:Tarjan's off-line lowest common ancestors algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 77.234.29.251 (talk) at 13:26, 30 July 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

I think that this article needs to be examined for possible copyright issues. The pseudocode is taken directly from "Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, Introduction to Algorithms, MIT Press and McGraw-Hill, 1990." (I looked at this earlier today when the database was locked — I can provide a page reference the next time I look at the book.) Boris Alexeev 19:26, 11 September 2005 (UTC)[reply]

Page 521 perhaps.

The algorithm itself is not invented by Tarjan, but rather by Aho, Hopcroft and Ullman (see Tarjan - Efficiency of a Good But Not Linear Set Union Algorithm, JACM Volume 22 , Issue 2 (April 1975), Pages: 215 - 225). So this must be a mistake in Cormen at al. I believe this article must be renamed or removed. -- Andrew Stankevich

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Tarjan%27s_off-line_lowest_common_ancestors_algorithm&oldid=148047256"