A simple modi-cation of PC and PC-derived algorithms is proposed so as to ensure that all separating sets identified to remove dispensable edges are consistent with the final graph, enhancing the explainability of constraint-based methods.
Honghao Li
1 papers
Vincent Cabeli
Nadir Sella
H. Isambert