A dynamic algorithm for topologically sorting directed acyclic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3059, Issue , 2004, Pages 383-398

  Pearce, David J ^a   Kelly, Paul H J ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS; GRAPH THEORY;

DIRECTED ACYCLIC GRAPH (DAG); DYNAMIC ALGORITHM; EMPIRICAL - COMPARISONS; INSERTIONS AND DELETIONS; SPARSE GRAPHS; THEORETICAL COMPLEXITY; TIME COMPLEXITY; TOPOLOGICAL ORDER;

TOPOLOGY;

EID: 35048900606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_29     Document Type: Article

References (21)

1. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42, 1990.
2. S. Baswana, R. Hariharan, and S. Sen. Improved algorithms for maintaining transitive closure and all-pairs shortest paths in digraphs under edge deletions. In Proc. ACM Symposium on Theory of Computing, 2002.
3. A. M. Berman. Lower And Upper Bounds For Incremental Algorithms. PhD thesis, New Brunswick, New Jersey, 1992.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2001.
5. C. Demetrescu, D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proc. Workshop on Algorithm Engineering, pages 218-229. LNCS, 2000.
6. C. Demetrescu and G. F. Italiano. Fully dynamic transitive closure: breaking through the O(n2) barrier. In Proc. IEEE Symposium on Foundations of Computer Science, pages 381-389, 2000.
7. P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In Proc. ACM Symposium on Theory of Computing, pages 365-372, 1987.
8. H. Djidjev, G. E. Pantziou, and C. D. Zaroliagis. Improved algorithms for dynamic shortest paths. Algorithmica, 28(4):367-389, 2000.
9. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic shortest paths and negative cycle detection on digraphs with arbitrary arc weights. In P roc. European Symposium on Algorithms, pages 320-331, 1998.
10. Y. Ioannidis, R. Ramakrishnan, and L. Winger. Transitive closure algorithms based on graph traversal. ACM Transactions on Database Systems, 18(3):512-576, 1993.
11. G. F. Italiano, D. Eppstein, and Z. Galil. Dynamic graph algorithms. In Algorithms and Theory of Computation Handbook, CRC Press. 1999.
12. R. M. Karp. The transitive closure of a random digraph. Random Structures & Algorithms, 1(1):73-94, 1990.
13. I. Katriel. On algorithms for online topological ordering and sorting. Research Report MPI-I-2004-1-003, Max-Planck-Institut für Informatik, 2004.
14. V. King and G. Sagert. A fully dynamic algorithm for maintaining the transitive closure. In Proc. ACM Symposium on Theory of Computing, pages 492-498, 1999.
15. A. Marchetti-Spaccamela, U. Nanni, and H. Rohnert. Maintaining a topological order under edge insertions. Information Processing Letters, 59(1):53-58, 1996.
16. D. J. Pearce. Some directed graph algorithms and their application to pointer analysis (work in progress). PhD thesis, Imperial College, London, 2004.
17. D. J. Pearce, P. H. J. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. In Proc. IEEE workshop on Source Code Analysis and Manipulation, 2003.
18. G. Ramalingam. Bounded incremental computation, volume 1089 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
19. G. Ramalingam and T. Reps. On competitive on-line algorithms for the dynamic priority-ordering problem. Information Processing Letters, 51(3):155-161, 1994.
20. T. Reps. Optimal-time incremental semantic analysis for syntax-directed editors. In Proc. Symp. on Principles of Programming Languages, pages 169-176, 1982.
21. J. Zhou and M. Müller. Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs. Information Processing Letters, 88(4):195-200, 2003.