Minimal equivalent subgraphs containing a given set of arcs

We present a method to compute such an extension and show that if D is transitively closed, this problem can be solved in the same asymptotic time as computing a transitive reduction of D.