Figure 1From: Efficient reconstruction of biological networks via transitive reduction on general purpose graphics processorsTransitive reduction of an acyclic graph. The edge (a,c) is removed because of the indirect path (a,b,c). Similarly, (a,f) is removed because of the existence of several indirect paths between nodes a and f.Back to article page