Triangulation of an undirected graph
= Triangulation of an undirected graph
Triangulation adds fill edges to an undirected <graph> to make it a <chordal graph>. Given an elimination ordering, join all remaining neighbors of each removed vertex. The completed graph has that <perfect elimination ordering>. Fill edges can enlarge the <cliques> used for exact <probabilistic graphical model> inference, without changing the original probability factors; they do not assert new biological relationships.