19,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
10 °P sammeln
Andere Kunden interessierten sich auch für
![Tarjan's Strongly Connected Components Algorithm]( "Tarjan's Strongly Connected Components Algorithm")
Tarjan's Strongly Connected Components Algorithm22,99 €![Some Common Fixed Point Theorems In Metric And Cone Metric Spaces]( "Some Common Fixed Point Theorems In Metric And Cone Metric Spaces")
Some Common Fixed Point Theorems In Metric And Cone Metric Spaces32,99 €![Some Results on Fixed and Common Fixed Points]( "Some Results on Fixed and Common Fixed Points")
Some Results on Fixed and Common Fixed Points38,99 €![Existence of Common Fixed Points in Generalized Metric Spaces]( "Existence of Common Fixed Points in Generalized Metric Spaces")
Existence of Common Fixed Points in Generalized Metric Spaces32,99 €![Mathematics & Mathematics Education: Searching for Common Ground]( "Mathematics & Mathematics Education: Searching for Common Ground")
Mathematics & Mathematics Education: Searching for Common Ground74,99 €![A Study of Random Common Fixed Point Theory and its Applications]( "A Study of Random Common Fixed Point Theory and its Applications")
A Study of Random Common Fixed Point Theory and its Applications42,99 €![ON SOME QUEUING MODELS LINKED WITH A COMMON SERVER]( "ON SOME QUEUING MODELS LINKED WITH A COMMON SERVER")
ON SOME QUEUING MODELS LINKED WITH A COMMON SERVER26,99 €
High Quality Content by WIKIPEDIA articles! In computer science, Tarjan's off-line least common ancestors algorithm (more precisely, least should actually be lowest) is an algorithm for computing lowest common ancestors for pairs of nodes in a tree, based on the union-find data structure. The lowest common ancestor of two nodes d and e in a rooted tree T is the node g that is an ancestor of both d and e and that has the greatest depth in T. It is named after Robert Tarjan, who discovered the technique in 1979. Tarjan's algorithm is offline; that is, unlike other lowest common ancestor algorithms, it requires that all pairs of nodes for which the lowest common ancestor is desired must be specified in advance. The simplest version of the algorithm uses the union find data structure, which unlike other lowest common ancestor data structures can take more than constant time per operation when the number of pairs of nodes is similar in magnitude to the number of nodes. A later refinement by Gabow & Tarjan (1983) speeds the algorithm up to linear time.