An O(n2.75) algorithm for incremental topological ordering

We present a simple algorithm which maintains the topological order of a directed acyclic graph (DAG) with n nodes, under an online edge insertion sequence, in O(n2.75) time, independent of the num...