A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Transitive Reduction of a Directed Graph
1972
SIAM journal on computing (Print)
We consider economical representations for the path information in a directed graph. A directed graph G is said to be a transitive reduction of the directed graph G provided that (i) G has a directed path from vertex u to vertex v if and only if G has a directed path from vertex u to vertex v, and (ii) there is no graph with fewer arcs than G satisfying condition (i). Though directed graphs with cycles may have more than one such representation, we select a natural canonical representative as
doi:10.1137/0201008
fatcat:ymhisok6wjcn5isrolcbiutm7u