Junction tree
= Junction tree
A junction tree connects the <maximal cliques> of a <chordal graph> into a <tree> satisfying the <running intersection property>. Its edges carry separators equal to the intersections of the endpoint cliques. Assigning original factors to containing cliques permits exact <sum-product belief propagation> without summing independently over the entire collection of variables.