# Bibliography

Conference Paper (international conference)

### Characterization of inclusion neighbourhood in terms of the essential graph: Lower neighbours

**: **Proceedings of the 6th Workshop on Uncertainty Processing, p. 243-262
, Eds: Vejnarová J.

**: **University of Economics,
(Prague 2003)

**: **WUPES 2003. Workshop on Uncertainty Processing /6./,
(Hejnice, CZ, 24.09.2003-27.09.2003)

**: ** CEZ:AV0Z1075907

**: **GA201/01/1482, GA ČR

**: **essential graph,
inclusion neighbourhood,
Bayesian network

**(eng): **The topic of the paper is to characterize inclusion neighbourhood of a given equivalence class of Bayesian networks in terms of the respective essential graph. It is shown that every inclusion neighbour is uniquely described by a pair ([a,b],C) where [a,b] is a pair of distict nodes which is not an edge and C is a disjoint set of nodes. Given such [a,b] the collection of respective sets C is the union of two tufts. The least and maximal sets of these tufts can be read from the essential graph.

**: **12A

**: **BA