Robert Endre Tarjan (born April 30, 1948) is an American computer scientist and mathematician. He is the discoverer of several graph theory algorithms...
18 KB (1,511 words) - 22:37, 20 June 2024
Tarján is a Hungarian name, derived from an old Turkic title Tarkhan, meaning viceroy or prince. It may refer to: Tarján, Hungary James Tarjan (1952),...
482 bytes (69 words) - 15:14, 12 September 2023
Tarjan's algorithm may refer to one of several algorithms attributed to Robert Tarjan, including: Tarjan's strongly connected components algorithm Tarjan's...
1 KB (104 words) - 23:38, 12 September 2023
Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph...
13 KB (1,711 words) - 12:44, 5 July 2024
Tarján (German: Tarian) is a village in Komárom-Esztergom County, Hungary. Zsolt Hernádi, Hungarian businessman Official website Street map (Hungarian)...
2 KB (23 words) - 22:40, 8 June 2022
In computer science, Tarjan's off-line lowest common ancestors algorithm is an algorithm for computing lowest common ancestors for pairs of nodes in a...
4 KB (578 words) - 22:59, 10 May 2024
Dominator (graph theory) (redirect from Lengauer-Tarjan's algorithm)
direct solution is quadratic in the number of nodes, or O(n2). Lengauer and Tarjan developed an algorithm which is almost linear, and in practice, except for...
10 KB (1,117 words) - 00:21, 27 July 2024
James Edward Tarjan (born February 22, 1952, in Pomona, California) is an American chess Grandmaster. James Tarjan's father, George Tarjan (1912-1991)...
5 KB (603 words) - 04:26, 19 August 2024
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 (n))}...
33 KB (4,617 words) - 21:17, 12 May 2024
Then, Tarjan & Van Wyk (1988) discovered an O(n log log n)-time algorithm for triangulation, later simplified by Kirkpatrick, Klawe & Tarjan (1992)....
13 KB (1,386 words) - 13:45, 29 July 2024