Search Algorithms: CPC-Stable |
The CPC-Stable algorithm (add references) modifies CPC (see) in the same way that PC-Stable modifies PC. The adjacency search is modified so for depth i > 0, the graph obtained for for depth i is used to judge adjacencies for nodes. As a result, for instance, it is readily parallelizable, since the independence judgments within each depth are independent of each other. Also, it has been shown to reduce error for large searches.