| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524503 | Journal of Multivariate Analysis | 2005 | 13 Pages |
Abstract
We show that the problem of searching for v-structures in a directed acyclic graph can be decomposed into searches in its decomposed subgraphs. This result simplifies the search for v-structures and the recovery of local causal relationships.
Related Topics
Physical Sciences and Engineering
Mathematics
Numerical Analysis
Authors
Zhi Geng, Chi Wang, Qiang Zhao,