| http://dbpedia.org/ontology/abstract
|
In combinatorial mathematics and theoretic … 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.edges form the paths of the decomposition.
|
| http://dbpedia.org/ontology/wikiPageID
|
40006935
|
| http://dbpedia.org/ontology/wikiPageLength
|
8848
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1007270630
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Tree_%28graph_theory%29 +
, http://dbpedia.org/resource/Potential_method +
, http://dbpedia.org/resource/Combinatorics +
, http://dbpedia.org/resource/Edit_distance +
, http://dbpedia.org/resource/Theoretical_computer_science +
, http://dbpedia.org/resource/Graph_drawing +
, http://dbpedia.org/resource/Level_ancestor_problem +
, http://dbpedia.org/resource/Bitwise_operation +
, http://dbpedia.org/resource/Data_structure +
, http://dbpedia.org/resource/Complete_binary_tree +
, http://dbpedia.org/resource/Edge_contraction +
, http://dbpedia.org/resource/Link/cut_tree +
, http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
, http://dbpedia.org/resource/Greedy_embedding +
, http://dbpedia.org/resource/Lowest_common_ancestor +
, http://dbpedia.org/resource/Grammar-based_code +
, http://dbpedia.org/resource/Path_%28graph_theory%29 +
, http://dbpedia.org/resource/Amortized_analysis +
, http://dbpedia.org/resource/Fiber-optic_communication +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Harvtxt +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Technique +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Heavy_path_decomposition?oldid=1007270630&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Heavy_path_decomposition +
|
| owl:sameAs |
https://global.dbpedia.org/id/f6Gz +
, http://dbpedia.org/resource/Heavy_path_decomposition +
, http://www.wikidata.org/entity/Q17022001 +
, http://rdf.freebase.com/ns/m.0wbkwp7 +
|
| rdf:type |
http://dbpedia.org/ontology/TopicalConcept +
|
| rdfs:comment |
In combinatorial mathematics and theoretic … 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.edges form the paths of the decomposition.
|
| rdfs:label |
Heavy path decomposition
|
