Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Level_ancestor_problem> ?p ?o }
Showing triples 1 to 45 of
45
with 100 triples per page.
- Level_ancestor_problem abstract "In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given distance from the root of the tree.More precisely, let T be a rooted tree with n nodes, and let v be an arbitrary node of T. The level ancestor query LA(v,d) requests the ancestor of node v at depth d, where the depth of a node v in a tree is the number of edges on the shortest path from the root of the tree to node v.It is possible to solve this problem in constant time per query, after a preprocessing algorithm that takes O(n) and that builds a data structure that uses O(n) storage space.".
- Level_ancestor_problem thumbnail LevelAncestor.png?width=300.
- Level_ancestor_problem wikiPageID "35471883".
- Level_ancestor_problem wikiPageLength "9466".
- Level_ancestor_problem wikiPageOutDegree "21".
- Level_ancestor_problem wikiPageRevisionID "689303739".
- Level_ancestor_problem wikiPageWikiLink Array_data_structure.
- Level_ancestor_problem wikiPageWikiLink Category:Theoretical_computer_science.
- Level_ancestor_problem wikiPageWikiLink Category:Trees_(graph_theory).
- Level_ancestor_problem wikiPageWikiLink Data_structure.
- Level_ancestor_problem wikiPageWikiLink Eulerian_path.
- Level_ancestor_problem wikiPageWikiLink Graph_theory.
- Level_ancestor_problem wikiPageWikiLink Jagged_array.
- Level_ancestor_problem wikiPageWikiLink Lowest_common_ancestor.
- Level_ancestor_problem wikiPageWikiLink Method_of_Four_Russians.
- Level_ancestor_problem wikiPageWikiLink Path_(graph_theory).
- Level_ancestor_problem wikiPageWikiLink Precomputation.
- Level_ancestor_problem wikiPageWikiLink Preprocessor.
- Level_ancestor_problem wikiPageWikiLink Range_query_(database).
- Level_ancestor_problem wikiPageWikiLink Recursion.
- Level_ancestor_problem wikiPageWikiLink Shortest_path_problem.
- Level_ancestor_problem wikiPageWikiLink Theoretical_computer_science.
- Level_ancestor_problem wikiPageWikiLink Tree_(data_structure).
- Level_ancestor_problem wikiPageWikiLink Tree_(graph_theory).
- Level_ancestor_problem wikiPageWikiLink Vertex_(graph_theory).
- Level_ancestor_problem wikiPageWikiLink File:LevelAncestor.png.
- Level_ancestor_problem wikiPageWikiLinkText "Level ancestor problem".
- Level_ancestor_problem wikiPageWikiLinkText "level ancestor problem".
- Level_ancestor_problem subject Category:Theoretical_computer_science.
- Level_ancestor_problem subject Category:Trees_(graph_theory).
- Level_ancestor_problem hypernym Problem.
- Level_ancestor_problem type Area.
- Level_ancestor_problem type Disease.
- Level_ancestor_problem type Area.
- Level_ancestor_problem type Object.
- Level_ancestor_problem type Redirect.
- Level_ancestor_problem comment "In graph theory and theoretical computer science, the level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a given node at a given distance from the root of the tree.More precisely, let T be a rooted tree with n nodes, and let v be an arbitrary node of T.".
- Level_ancestor_problem label "Level ancestor problem".
- Level_ancestor_problem sameAs Q4274653.
- Level_ancestor_problem sameAs m.0j9q98t.
- Level_ancestor_problem sameAs ปัญหาระดับบรรพบุรุษ.
- Level_ancestor_problem sameAs Q4274653.
- Level_ancestor_problem wasDerivedFrom Level_ancestor_problem?oldid=689303739.
- Level_ancestor_problem depiction LevelAncestor.png.
- Level_ancestor_problem isPrimaryTopicOf Level_ancestor_problem.
