Fixed Ordering I
n
Restrict to networks consistent with a
fixed total
ordering
p
of the nodes*
n
A
®
B
̃
A
p
B
n
n
Also each node X
i
has a set
W
i
of at most k possible
candidate parents**
U
i,
p
=
n
Define:
Subsets of candidate parents of X
i
that
are consistent with the ordering
p
*Friedman& Koller 2000, **Friedman, Nachman & Pe’er 1999