Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Tarjans_off-line_lowest_common_ancestors_algorithm> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Tarjans_off-line_lowest_common_ancestors_algorithm abstract "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 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 an offline algorithm; 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.".
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageID "243227".
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageLength "4029".
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageOutDegree "11".
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageRevisionID "683061366".
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Algorithm.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Category:Graph_algorithms.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Computer_science.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Disjoint-set_data_structure.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Journal_of_the_ACM.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Linear_time.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Lowest_common_ancestor.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Robert_Tarjan.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Rooted_tree.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Time_complexity.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Tree_(graph_theory).
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLink Union-find.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLinkText "Tarjan's off-line lowest common ancestors algorithm".
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageWikiLinkText "computing lowest common ancestors of an offline batch of pairs of nodes".
- Tarjans_off-line_lowest_common_ancestors_algorithm hasPhotoCollection Tarjans_off-line_lowest_common_ancestors_algorithm.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageUsesTemplate Template:Citation.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageUsesTemplate Template:Distinguish.
- Tarjans_off-line_lowest_common_ancestors_algorithm wikiPageUsesTemplate Template:Harvtxt.
- Tarjans_off-line_lowest_common_ancestors_algorithm subject Category:Graph_algorithms.
- Tarjans_off-line_lowest_common_ancestors_algorithm hypernym Algorithm.
- Tarjans_off-line_lowest_common_ancestors_algorithm type Software.
- Tarjans_off-line_lowest_common_ancestors_algorithm type Thing.
- Tarjans_off-line_lowest_common_ancestors_algorithm comment "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 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.".
- Tarjans_off-line_lowest_common_ancestors_algorithm label "Tarjan's off-line lowest common ancestors algorithm".
- Tarjans_off-line_lowest_common_ancestors_algorithm differentFrom Tarjans_strongly_connected_components_algorithm.
- Tarjans_off-line_lowest_common_ancestors_algorithm sameAs الگوریتم_کمترین_والدین_مشترک_تارجان.
- Tarjans_off-line_lowest_common_ancestors_algorithm sameAs Algorytm_Tarjana_znajdowania_najniższego_wspólnego_przodka.
- Tarjans_off-line_lowest_common_ancestors_algorithm sameAs m.01k8dj.
- Tarjans_off-line_lowest_common_ancestors_algorithm sameAs ขั้นตอนวิธีการหาปมบรรพบุรุษร่วมใกล้สุดของคู่ปมของทาร์จาน.
- Tarjans_off-line_lowest_common_ancestors_algorithm sameAs Q4919359.
- Tarjans_off-line_lowest_common_ancestors_algorithm sameAs Q4919359.
- Tarjans_off-line_lowest_common_ancestors_algorithm wasDerivedFrom Tarjans_off-line_lowest_common_ancestors_algorithmoldid=683061366.
- Tarjans_off-line_lowest_common_ancestors_algorithm isPrimaryTopicOf Tarjans_off-line_lowest_common_ancestors_algorithm.