{"version":"1.0","type":"link","title":"Transitive reduction - Newikis","description":"In the mathematical field of graph theory, a transitive reduction of a directed graph D 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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}