# zbMATH — the first resource for mathematics

Decomposition of search for $$v$$-structures in DAGs. (English) Zbl 1137.62420
Summary: 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.

##### MSC:
 62P99 Applications of statistics 05C20 Directed graphs (digraphs), tournaments 62H99 Multivariate analysis 05C90 Applications of graph theory