A batch algorithm for maintaining a topological order

The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change version of this problem, where the order is updated after every single insertion. No previous (non-trivial) algorithms are known for the batch version of the problem, where the order is updated after every batch of insertions. We present the first such algorithm. This requires O(min{k

• Type: Journal
• Year: 2010
• Where: ACSC
• Authors: David J. Pearce, Paul H. J. Kelly
• Keywords: ACSC 2010, Algorithms, Dynamic Topological Order, Theoretical Computer Science, Topological Order