Is there a name for the relationship between two DAGs
B is one of the transitive reductions of the transitive closure
For example the connectivity of nodes in both graphs would still be the same.
For example, we can connect all nodes in
A to their minimal elements (smallest subsets) in
A and remove all other edges, leading to