I am looking for algorithms that allow to verify if a dependency
model from a data set is isomorphic to an undirected graph.
Are there any efficient implementation of the characterization given
by Pearl in terms of five axioms for independency models isomorphic to
undirected graphs ?
Regards,
Roberto Santana
Center of Mathematics and Theoretical Physics, ICIMAF
Havana, Cuba