All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 11:25, 15 February 2023 Admin talk contribs created page Transitive Reduction Problem of Directed Graphs (Created page with "{{DISPLAYTITLE:Transitive Reduction Problem of Directed Graphs (Transitive Reduction Problem)}} == Description == A directed graph $G^t$ 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^t$ satisfying condition (i). The problem asks to find such a graph $G^t$ for a g...")