1 Addressing and Routing in Multi-substrate Overlay Networks Jorg Liebeherr University of Toronto Joint work with: Majid Valipour and Boris Drazic.
An almost linear fully dynamic reachability algorithm.
Liam Roditty Reachability in Directed Graphs. Connectivity in undirected graphs Given two vertices decide whether they are in the same component. Reachability.
