Tree decomposition

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; they play an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.

单词	Tree decomposition
释义	Tree decomposition 英语百科 Tree decomposition 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; they play an important role in problems like probabilistic inference, constraint satisfaction, query optimization, and matrix decomposition.
随便看	flown straight down into flown the coop flown to armes flown to arms flow number flown up flown upon flow of air flow of amalgam flow of blood flow of bubble flow of capital flow of cash flow of cement mortar flow of chip flow of commodity flow of communication and control flow of condensate Flow of control flow of control model flow of control programming flow of conversation flow of cooling water flow of cost flow of costs