Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tree_decomposition> ?p ?o. }
Showing items 1 to 40 of
40
with 100 items per page.
- Tree_decomposition abstract "In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain computational problems on the graph.In machine learning, tree decompositions are also called junction trees, clique trees, or join trees; theyplay an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.The concept of tree decompositions was originally introduced by Rudolf Halin (1976). Later it was rediscovered by Neil Robertson and Paul Seymour (1984) and has since been studied by many other authors.".
- Tree_decomposition thumbnail Tree_decomposition.svg?width=300.
- Tree_decomposition wikiPageExternalLink graph.theory.
- Tree_decomposition wikiPageID "159023".
- Tree_decomposition wikiPageRevisionID "592364676".
- Tree_decomposition author1Link "Neil Robertson".
- Tree_decomposition author2Link "Paul Seymour".
- Tree_decomposition authorlink "Rudolf Halin".
- Tree_decomposition first "Neil".
- Tree_decomposition first "Paul".
- Tree_decomposition first "Rudolf".
- Tree_decomposition hasPhotoCollection Tree_decomposition.
- Tree_decomposition last "Halin".
- Tree_decomposition last "Robertson".
- Tree_decomposition last "Seymour".
- Tree_decomposition year "1976".
- Tree_decomposition year "1984".
- Tree_decomposition subject Category:Graph_minor_theory.
- Tree_decomposition subject Category:Graph_theory_objects.
- Tree_decomposition subject Category:Trees_(graph_theory).
- Tree_decomposition type Abstraction100002137.
- Tree_decomposition type Action114006945.
- Tree_decomposition type Attribute100024264.
- Tree_decomposition type GraphOperations.
- Tree_decomposition type Operation114008806.
- Tree_decomposition type State100024720.
- Tree_decomposition comment "In graph theory, a tree decomposition is a mapping of a graph into a tree that can be used to define the treewidth of the graph and speed up solving certain computational problems on the graph.In machine learning, tree decompositions are also called junction trees, clique trees, or join trees; theyplay an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.The concept of tree decompositions was originally introduced by Rudolf Halin (1976). ".
- Tree_decomposition label "Descomposición en árbol".
- Tree_decomposition label "Décomposition arborescente".
- Tree_decomposition label "Tree decomposition".
- Tree_decomposition sameAs Stromový_rozklad.
- Tree_decomposition sameAs Descomposición_en_árbol.
- Tree_decomposition sameAs Décomposition_arborescente.
- Tree_decomposition sameAs m.014_2n.
- Tree_decomposition sameAs Q462095.
- Tree_decomposition sameAs Q462095.
- Tree_decomposition sameAs Tree_decomposition.
- Tree_decomposition wasDerivedFrom Tree_decomposition?oldid=592364676.
- Tree_decomposition depiction Tree_decomposition.svg.
- Tree_decomposition isPrimaryTopicOf Tree_decomposition.