Revision as of 20:59, 26 June 2012 edit 84.114.18.215 (talk) →Decomposition methods: The example instance did not match the decomposition. Two variables were swapped. ← Previous edit		Revision as of 21:08, 19 March 2013 edit undo 76.184.244.214 (talk) typo Next edit →
Line 139: \|} This translation requires the maximal cliques of a chordal graph to be identified. However, this can ~~bone~~be done easily using the same ordering used for enforcing chordality. Since the parents of each node are all connected to each other, the maximal cliques are composed of a node (the maximal node of the clique in a max-cardinality ordering) and all its parents. As a result, these maximal cliques can be detected by considering each node with its parents. The problem that results from this process has a join tree, and such a join tree can be obtained by using the same ordering of variables again. Proceeding from the last node to the first, every constraint is connected with the preceding constraint that shares more variables with it. Join-tree clustering can be seen as a decomposition method in which:

Decomposition method (constraint satisfaction): Difference between revisions