eb 2 00 8 Average - Case Analysis of Online Topological Ordering ∗


Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates. All known algorithms for this problem are either only analyzed for worst-case insertion sequences or only evaluated experimentally on random DAGs. We present the first average… (More)


1 Figure or Table