Decomposition of search for -structures in DAGs

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.