### COMP 150PGM - Spring 2011 - Homework 7

Due in class on Wednesday, April 13

- Draw the undirected graph associated with the factors P(A)P(B,C|A)P(D,E|B,C)P(F|D,E)
and characterize the possible orderings produced by the Max-Cardinality algorithm
(9.3 on p. 312).
- Draw the undirected graph associated with the factors f1(A, B, C), f2(C,
D), and f3(D, E, F) and and characterize the possible orderings produced by
the Max-Cardinality algorithm.
- Show that none of the orderings in Exercise 2 introduce any fill edges.
- (Extra credit) Prove Theorem 9.10 on p. 313.