Improved dynamic reachability algorithms for directed graphs改进的有向图的动态可达性算法.pptVIP

Improved dynamic reachability algorithms for directed graphs Liam Roditty and Uri Zwick Tel Aviv University Dynamic reachability Decremental reachability - Results Fully dynamic reachability - Results Fully dynamic reachability - Results Decremental maintenance of a reachability tree in a DAG – Italiano’s algorithm Decremental maintenance of a reachability tree in a general graph  Frigioni, Miller, Nanni and Zaroliagis ’01 When a SCC decomposes How do we maintain the SCCs? FMNZ’01 recompute the SCCs for each deleted edge. Thus, the worst-case complexity of their algorithm is O(m2). We mainta