Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Heavy_path_decomposition> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Heavy_path_decomposition abstract "In combinatorial mathematics and theoretical computer science, heavy path decomposition (also called heavy-light decomposition) is a technique for decomposing a rooted tree into a set of paths. In a heavy path decomposition, each non-leaf node selects one "heavy edge", the edge to the child that has the greatest number of descendants (breaking ties arbitrarily). The selected edges form the paths of the decomposition.".
- Heavy_path_decomposition wikiPageID "40006935".
- Heavy_path_decomposition wikiPageLength "8819".
- Heavy_path_decomposition wikiPageOutDegree "19".
- Heavy_path_decomposition wikiPageRevisionID "624763721".
- Heavy_path_decomposition wikiPageWikiLink Amortized_analysis.
- Heavy_path_decomposition wikiPageWikiLink Binary_tree.
- Heavy_path_decomposition wikiPageWikiLink Bitwise_operation.
- Heavy_path_decomposition wikiPageWikiLink Category:Trees_(graph_theory).
- Heavy_path_decomposition wikiPageWikiLink Combinatorics.
- Heavy_path_decomposition wikiPageWikiLink Complete_binary_tree.
- Heavy_path_decomposition wikiPageWikiLink Data_structure.
- Heavy_path_decomposition wikiPageWikiLink Edge_contraction.
- Heavy_path_decomposition wikiPageWikiLink Edit_distance.
- Heavy_path_decomposition wikiPageWikiLink Fiber-optic_communication.
- Heavy_path_decomposition wikiPageWikiLink Grammar-based_code.
- Heavy_path_decomposition wikiPageWikiLink Graph_drawing.
- Heavy_path_decomposition wikiPageWikiLink Greedy_embedding.
- Heavy_path_decomposition wikiPageWikiLink Level_ancestor_problem.
- Heavy_path_decomposition wikiPageWikiLink cut_tree.
- Heavy_path_decomposition wikiPageWikiLink Lowest_common_ancestor.
- Heavy_path_decomposition wikiPageWikiLink Path_(graph_theory).
- Heavy_path_decomposition wikiPageWikiLink Potential_method.
- Heavy_path_decomposition wikiPageWikiLink Theoretical_computer_science.
- Heavy_path_decomposition wikiPageWikiLink Tree_(graph_theory).
- Heavy_path_decomposition wikiPageWikiLinkText "heavy path decomposition".
- Heavy_path_decomposition hasPhotoCollection Heavy_path_decomposition.
- Heavy_path_decomposition wikiPageUsesTemplate Template:Harvtxt.
- Heavy_path_decomposition wikiPageUsesTemplate Template:Reflist.
- Heavy_path_decomposition subject Category:Trees_(graph_theory).
- Heavy_path_decomposition hypernym Technique.
- Heavy_path_decomposition type Software.
- Heavy_path_decomposition comment "In combinatorial mathematics and theoretical computer science, heavy path decomposition (also called heavy-light decomposition) is a technique for decomposing a rooted tree into a set of paths. In a heavy path decomposition, each non-leaf node selects one "heavy edge", the edge to the child that has the greatest number of descendants (breaking ties arbitrarily). The selected edges form the paths of the decomposition.".
- Heavy_path_decomposition label "Heavy path decomposition".
- Heavy_path_decomposition sameAs m.0wbkwp7.
- Heavy_path_decomposition sameAs Q17022001.
- Heavy_path_decomposition sameAs Q17022001.
- Heavy_path_decomposition wasDerivedFrom Heavy_path_decomposition?oldid=624763721.
- Heavy_path_decomposition isPrimaryTopicOf Heavy_path_decomposition.