Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms...

Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph...

Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including: Tarjan's strongly connected components algorithm Tarjan's...

to: Tarján, Hungary James Tarjan (1952), American chess grandmaster Robert Tarjan (1948), American computer scientist Tarcan (disambiguation) Tarkan (disambiguation)...

the greatest depth in T. It is named after Robert Tarjan, who discovered the technique in 1979. Tarjan's algorithm is an offline algorithm; that is,...

States. In 1999, he won the ACM Paris Kanellakis Award (jointly with Robert Tarjan) for the splay tree data structure. He was one of the pioneers in amortized...

fit that pattern. The splay tree was invented by Daniel Sleator and Robert Tarjan in 1985. All normal operations on a binary search tree are combined...

number of edges) for finding the bridges in a graph was described by Robert Tarjan in 1974. It performs the following steps: Find a spanning forest of...

logarithm of n {\displaystyle n} , by Hopcroft and Ullman. In 1975, Robert Tarjan was the first to prove the O ( m α ( n ) ) {\displaystyle O(m\alpha...

components in a connected undirected graph is due to John Hopcroft and Robert Tarjan (1973). It runs in linear time, and is based on depth-first search....