Revisiting Diameter in Directed Graphs

Ben Bals, Joakim Blikstad, Daniel Dadush +2

The reachability diameter ($\mathrm{ReachDiam}$) of a directed graph is the maximum distance over all pairs $u,v$ where $v$ is reachable from $u$. This notion is present in the def…