Explore relationships

Transitive reduction

In the mathematical field of graph theory, a transitive reduction of a directed graphD is another directed graph with the same vertices and as few edges as possible, such that for all pairs v, w of vertices, a (directed) path from v to w in D exists if and only if such a path exists in the reduction.

Use + to expand a branch. Click a topic name to open its summary.