Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
On competitive on-line algorithms for the dynamic priority-ordering problem
Information Processing Letters
Maintaining a topological order under edge insertions
Information Processing Letters
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A constraint-based architecture for local search
OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
On-line Graph Algorithms for Incremental Compilation
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis
Software Quality Control
ACM Transactions on Algorithms (TALG)
An O(n2.75) algorithm for online topological ordering
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
An O(n2.75) algorithm for incremental topological ordering
ACM Transactions on Algorithms (TALG)
A new approach to incremental topological ordering
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A batch algorithm for maintaining a topological order
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
| Hi-index | 5.23 |
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).