Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
Information Processing Letters
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
A dynamic topological sort algorithm for directed acyclic graphs
Journal of Experimental Algorithmics (JEA)
A tight analysis of the Katriel–Bodlaender algorithm for online topological ordering
Theoretical Computer Science
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
Average-case analysis of online topological ordering
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
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
Hi-index | 0.89 |