Yahoo Search Busca da Web

i10-index. 311. 175. Robert Tarjan. Professor of Computer Science, Princeton University. Verified email at cs.princeton.edu. data structures graph algorithms analysis of algorithms.

Robert E. Tarjan; Department of Computer Science Princeton University 35 Olden Street, Room 324 Princeton, NJ 08544-2087 Phone: (609) 270-1355 FAX: (609) 258-1771

Subjects. Additional. Materials. Video Interview. Bob Tarjan was born on April 30, 1948 in Pomona, California. He received a B.S. in mathematics from Caltech in 1969, and was determined to do a Ph.D. but was undecided between mathematics and computer science.

Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph. It runs in linear time , matching the time bound for alternative methods including Kosaraju's algorithm and the path-based strong component algorithm .

Robert Endre Tarjan é um informático estadunidense. Foi condecorado com o Prêmio Turing de 1986, juntamente com John Hopcroft‎, pelo projeto e análise de algorítmos e estruturas de dados. É professor da Universidade de Princeton e trabalha na Hewlett-Packard.

Robert Tarjan mostrou (1974) como a busca DFS pode ser usada para verificar, eficientemente, a existência de pontes. O algoritmo de Tarjan é o assunto principal deste capítulo. Para entender o algoritmo será necessário percorrer um caminho relativamente longo.

ROBERTTARJAN" Abstract.Thevalueofdepth-first searchor "bacltracking"as atechniquefor solvingproblemsis illustrated bytwoexamples. Animprovedversion ofan algorithm for finding the strongly connected components ofa directed graph andar algorithm for finding the biconnected componentsofan un-direct graph are presented.

Tarjan 算法是基于对图深度优先搜索的算法，每个强连通分量为搜索树中的一棵子树。 搜索时，把当前搜索树中未处理的节点加入一个堆栈，回溯时可以判断栈顶到栈中的节点是否为一个强连通分量。

26 de abr. de 2023 · Robert Endre Tarjan, (born April 30, 1948, Pomona, California, U.S.), computer scientist and cowinner of the 1986 A.M. Turing Award, the highest honour in computer science, for “fundamental achievements in the design and analysis of algorithms and data structures.”