Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Heavy_path_decomposition> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items 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 wikiPageRevisionID "574419550".
- Heavy_path_decomposition subject Category:Trees_(graph_theory).
- 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=574419550.
- Heavy_path_decomposition isPrimaryTopicOf Heavy_path_decomposition.