Home > Term: transitive reduction
transitive reduction
The transitive reduction of a directed graph G is the directed graph G' with the smallest number of edges such that for every path between vertices in G, G' has a path between those vertices.
- Ordklass: noun
- Bransch/domän: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Skapad av
- GeorgeV
-
(Gold) 1123 points - 100% positive feedback
