Tarjan's Off-Line Least Common Ancestors Algorithm
CHF 39.45
Auf Lager
SKU
SV5190QDVPQ
1 Verfügbar 
Kostenloser Versand ab CHF 50
Geliefert zwischen Do., 09.10.2025 und Fr., 10.10.2025
Details
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.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131170973
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- EAN 9786131170973
- Format Fachbuch
- Titel Tarjan's Off-Line Least Common Ancestors Algorithm
- Herausgeber Betascript Publishing
- Anzahl Seiten 68
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
