A dynamic topological sort algorithm for directed acyclic graphs

ACM Journal of Experimental Algorithmics

Volumn 11, Issue , 2006, Pages

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

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms; Dynamic graph algorithms; E.1 data structures : Graphs and networks; Experimentation; F.2.2 analysis of algorithms and problem complexity : Nonnumerical algorithms and problems computations on discrete structures; G.2.2 discrete mathematics : Graph theory graph algorithms; Theory; Topological sort

Indexed keywords

EID: 84940385899     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1187436.1210590     Document Type: Article

References (38)

1. AIELLO, W., CHUNG, F., AND LU, L. 2000. A random graph model for power law graphs. In Proceedings of the ACM Symposium on the Theory of Computing (STOC). 171-180.
2. 2.75) algorithm for online topological ordering. In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science, vol. 4059. Springer-Verlag, New York. 53-74.
3. ALPERN, B., HOOVER, R., ROSEN, B. K., SWEENEY, P. F., AND ZADECK, F. K. 1990. Incremental evaluation of computational circuits. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM Press, New York. 32-42.
4. BARAK, A. AND ERDÖS, P. 1984. On the maximal number of strongly independent vertices in a random acyclic directed graph. 5, 4, 508-514.
5. BASWANA, S., HARIHARAN, R., AND SEN, S. 2002. Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths in digraphs under edge deletions. In Proceedings of the ACM Symposium on Theory of Computing (STOC). ACM Press, New York. 117-123.
6. BENDER, M. A., COLE, R., DEMAINE, E. D., FARACH-COLTON, M., AND ZITO, J. 2002. Two simplified algorithms for maintaining order in a list. In Proceedings of the European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2461. Springer-Verlag, New York. 152-164.
7. BERMAN, A. M. 1992. Lower and upper bounds for incremental algorithms. Ph.D. thesis, Rutgers University, New Brunswick, New Jersey.
8. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms. MIT Press, Cambridge, MA.
9. 2) barrier. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Washington, DC. 381-389.
10. DEMETRESCU, C., FRIGIONI, D., MARCHETTI-SPACCAMELA, A., AND NANNI, U. 2000. Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study. In Proceedings of the Workshop on Algorithm Engineering (WAE). Lecture Notes in Computer Science, vol. 1982. Springer-Verlag, New York. 218-229.
11. DIETZ, P. F. AND SLEATOR, D. D. 1987. Two algorithms for maintaining order in a list. In Proceedings of the ACM Symposium on Theory of Computing (STOC). ACM Press, New York. 365-372.
12. DJIDJEV, H., PANTZIOU, G. E., AND ZAROLIAGIS, C. D. 2000. Improved algorithms for dynamic shortest paths. Algorithmica 28, 4, 367-389.
13. ERDÖS, P. AND RÉNYI, A. 1960. On the evolution of random graphs. Mathematical Institute of the Hungarian Academy of Sciences 5, 17-61.
14. FRIGIONI, D., MARCHETTI-SPACCAMELA, A., AND NANNI, U. 1994. Incremental algorithms for the single-source shortest path problem. In Proceedings of the conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Lecture Notes in Computer Science, vol. 880. Springer-Verlag, New York. 113-124.
15. FRIGIONI, D., MARCHETTI-SPACCAMELA, A., AND NANNI, U. 1998. Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights. In Proceedings of the European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 1461. Springer-Verlag, New York. 320-331.
16. HOOVER, R. 1987. Ph.D. thesis. Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, New York.
17. IDE, J. S. AND COZMAN, F. G. 2002. Random generation of bayesian networks. In Proceedings of the Brazillian Symposium on Artificial Intelligence (SBIA). Vol. 2507. Springer-Verlag, New York. 366-375.
18. ITALIANO, G. F., EPPSTEIN, D., AND GALIL, Z. 1999. Dynamic graph algorithms. In Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, Boca Raton, FL.
19. JANSON, S., LUCZAK, T., AND RUCINSKI, A. 2000. Random Graphs. Wiley, New York.
20. KATRIEL, I. 2004. Online topological ordering and sorting. Tech. rep., Max-Planck-Institut für Informatik.
21. KATRIEL, I. AND BODLAENDER, H. L. 2005. Online topological ordering. In Proceedings of the ACM Symposium on Discrete Algorithms (SODA). ACM Press, New York. 443-450.
22. KATRIEL, I., MICHEL, L., AND HENTENRYCK, P. V. 2005. Maintaining longest paths incrementally. Constraints 10, 2, 159-183.
23. KING, V. AND SAGERT, G. 1999. A fully dynamic algorithm for maintaining the transitive closure. In Proceedings of the ACM Symposium on Theory of Computing (STOC). ACM Press, New York. 492-498.
24. MARCHETTI-SPACCAMELA, A., NANNI, U., AND ROHNERT, H. 1996. Maintaining a topological order under edge insertions. Information Processing Letters 59, 1, 53-58.
25. MELAÇON, G., BOUSQUET-MELOU, M., AND DUTOR, I. 2001. Random generation of directed acyclic graphs. In Proceedings of the Euroconference on Combinatorics, Graph Theory and Applications (COMB). Elsevier Science, New York. 12-15.
26. PEARCE, D. J. 2005. Some directed graph algorithms and their application to pointer analysis. Ph.D. thesis, Imperial College, London.
27. PEARCE, D. J. AND KELLY, P. H. J. 2004. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proceedings of the Workshop on Efficient and experimental Algorithms (WEA). Lecture Notes in Computer Science, vol. 3059. Springer-Verlag, New York. 383-398.
28. PEARCE, D. J., KELLY, P. H. J., AND HANKIN, C. 2004. Online cycle detection and difference propagation: Applications to pointer analysis. Software Quality Journal 12, 309-335.
29. PITTEL, B. AND TUNGOL, R. 2001. A phase transition phenomenon in a random directed acyclic graph. RSA: Random Structures & Algorithms 18, 2, 164-184.
30. RAMALINGAM, G. 1996. Bounded incremental computation. Ph.D. thesis. Lecture Notes in Computer Science, vol. 1089. Springer-Verlag, New York.
31. RAMALINGAM, G. AND REPS, T. 1994. On competitive on-line algorithms for the dynamic priority-ordering problem. Information Processing Letters 51, 3, 155-161.
32. RAMALINGAM, G. AND REPS, T. 1996. On the computational complexity of dynamic graph problems. Theoretical Computer Science 158, 1-2, 233-277.
33. REPS, T. 1982. Optimal-time incremental semantic analysis for syntax-directed editors. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). ACM Press, New York. 169-176.
34. REPS, T., MARCEAU, C., AND TEITELBAUM, T. 1986. Remote attribute updating for language-based editors. In Proceedings of the ACM Symposium on the Principles of Programming Languages (POPL). ACM Press, New York. 1-13.
35. SIEK, J., LEE, L.-Q., AND LUMSDAINE, A. 2002. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, Reading, MA.
36. WIRN, M. 1993. Bounded incremental parsing. In Proceedings of the Twente Workshop on Language Technology (TWLT). University of Twente, University of Twente, Enschede, The Netherlands. 145-156.
37. YEH, D. 1983. On incremental evaluation of ordered attributed grammars. BIT 23, 308-320.
38. ZHOU, J. AND MÜLLER, M. 2003. Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs. Information Processing Letters 88, 4, 195-200.