Abstract
It is shown that the problem of maintaining the topological order of the nodes of
a directed acyclic graph while inserting m edges can be solved in O(min{m3/2 log n,m3/2 +
n2 log n}) time, an improvement over the best known result of O(mn). In addition, we analyze the complexity of the
... read more