A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering

Katriel and Bodlaender [Irit Katriel, Hans L. Bodlaender, Online topological ordering, ACM Transactions on Algorithms 2 (3) (2006) 364-379] modify the algorithm proposed by Alpern et al. [Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck, Incremental evaluation of computational circuits, in: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 32-42] for maintaining the topological order of the n nodes of a directed acyclic graph while inserting m edges and prove that their algorithm runs in O(min{m^3^/^2logn,m^3^/^2+n^2logn}) time and has an @W(m^3^/^2) lower bound. In this paper, we give a tight analysis of their algorithm by showing that it runs in time @Q(m^3^/^2+mn^1^/^2logn).

[1]  Ulrich Meyer,et al.  An O(n2.75) Algorithm for Online Topological Ordering , 2006, SWAT.

[2]  Hans L. Bodlaender,et al.  Online topological ordering , 2005, SODA '05.

[3]  Alberto Marchetti-Spaccamela,et al.  Maintaining a Topological Order Under Edge Insertions , 1996, Inf. Process. Lett..

[4]  Irit Katriel,et al.  On algorithms for online topological ordering and sorting , 2004 .

[5]  Alberto Marchetti-Spaccamela,et al.  On-line Graph Algorithms for Incremental Compilation , 1993, WG.

[6]  Bowen Alpern,et al.  Incremental evaluation of computational circuits , 1990, SODA '90.

[7]  Chris Hankin,et al.  Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis , 2004, Software Quality Journal.

[8]  Paul F. Dietz,et al.  Two algorithms for maintaining order in a list , 1987, STOC.

[9]  David J. Pearce,et al.  Some directed graph algorithms and their application to pointer analysis , 2005 .

[10]  Jorma Tarhio,et al.  Multipattern string matching with q-grams , 2007, ACM J. Exp. Algorithmics.

[11]  Pascal Van Hentenryck,et al.  A constraint-based architecture for local search , 2002, OOPSLA '02.

[12]  Thomas W. Reps,et al.  On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem , 1994, Inf. Process. Lett..

[13]  Paul H. J. Kelly,et al.  A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs , 2004, WEA.

[14]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[15]  Richard Cole,et al.  Two Simplified Algorithms for Maintaining Order in a List , 2002, ESA.