Talk:Robert Tarjan

Editing
Would like to contact Drmies to discuss recent edits. Please let me know how. Thanks!

Untitled
This guy is a freaking genius!

Tarjan is known for off-line nearest common ancestors? Really? Couldn't you find anything better.

The LCA algorithm is not even invented by Tarjan. — Preceding unsigned comment added by 12.155.35.66 (talk) 01:34, 11 July 2011 (UTC)

There is a pop-culture reference to Tarjan in the RPG video game series "The Bard's Tale", where one of the adversaries is "the mad god Tarjan". In a game concerned with mazes, can't be a coincidence.

Series - parallel graphs
In 1983 Tarjan also contributed to the Goldberg et al. topology of series - parallel graphs. They published an decision algorithm to test whether or not a graph is in fact SP. Along with Tarjan's strongly connected components algorithm these comprise the only new topological analyses in graph theory since Kuratovsky. This algorithm has practical relevance to graph drawing (as of course does the Hopcroft Tarjan planarity test).

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Robert Tarjan. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20101010023119/http://media.caltech.edu/press_releases/13332 to http://media.caltech.edu/press_releases/13332

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 08:56, 3 December 2017 (UTC)