1 problem

Let $G$ be a directed acyclic graph (DAG), and let $i,j$ be vertices of $G$. A d-separating set for $i$ and $j$ is a set of vertices that d-separates them; consider the minimum car…