Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower and upper bounds for incremental algorithms
Lower and upper bounds for incremental algorithms
On competitive on-line algorithms for the dynamic priority-ordering problem
Information Processing Letters
Bounded incremental computation
Bounded incremental computation
On the computational complexity of dynamic graph problems
Theoretical Computer Science
Maintaining a topological order under edge insertions
Information Processing Letters
A fully dynamic algorithm for maintaining the transitive closure
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Incremental evaluation of computational circuits
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A phase transition phenomenon in a random directed acyclic graph
Random Structures & Algorithms
The boost graph library: user guide and reference manual
The boost graph library: user guide and reference manual
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Remote attribute updating for language-based editors
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to Algorithms
Optimal-time incremental semantic analysis for syntax-directed editors
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Random Generation of Bayesian Networks
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Incremental Algorithms for the Single-Source Shortest Path Problem
Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Fully dynamic transitive closure: breaking through the O(n/sup 2/) barrier
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
Information Processing Letters
Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis
Software Quality Control
Maintaining Longest Paths Incrementally
Constraints
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An O(n2.75) algorithm for online topological ordering
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Efficient field-sensitive pointer analysis of C
ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards a solution for synchronizing disparate models of ultra-large-scale systems
Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems
An O(n2.75) algorithm for incremental topological ordering
ACM Transactions on Algorithms (TALG)
Expediting RL by using graphical structures
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Markov blanket feature selection for support vector machines
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Average-case analysis of incremental topological ordering
Discrete Applied Mathematics
Average-case analysis of online topological ordering
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Probabilistic and analytical estimation of software development team size
International Journal of Hybrid Intelligent Systems
A batch algorithm for maintaining a topological order
ACSC '10 Proceedings of the Thirty-Third Australasian Conferenc on Computer Science - Volume 102
Proceedings of the 2011 ACM Symposium on Applied Computing
A methodology to design virtual cellular manufacturing systems
Journal of Intelligent Manufacturing
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
An Optimal Constraint Programming Approach to the Open-Shop Problem
INFORMS Journal on Computing
Hi-index | 0.00 |
We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against the three main alternatives over a large number of random DAGs. The results show our algorithm is the best for sparse digraphs and only a constant factor slower than the best on dense digraphs.