A new approach to incremental topological ordering

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1108-1115

  Bender, Michael A ^a   Finenman, Jeremy T ^b   Gilbert, Seth ^c  

^a STONY BROOK UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS;

DIRECTED ACYCLIC GRAPH (DAG); DYNAMIC CHANGES; EDGE ADDITION; EMPTY GRAPH; NEW APPROACHES; TOPOLOGICAL ORDER; TOTAL ORDER; UNDERLYING GRAPHS;

TOPOLOGY;

EID: 70349140034     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.120     Document Type: Conference Paper

References (19)

1. D. Ajwani and T. Friedrich. Average-case analysis of online topological ordering. In T. Tokuyama, editor, ISAAC, volume 4835 of Lecture Notes in Computer Science, pages 464-475. Springer, 2007.
2. 2.75) algorithm for online topological ordering. In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, volume 4059 of Lecture Notes in Computer Science, pages 53-64. Springer, 2006.
3. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42, 1990.
4. F. Belik. An efficient deadlock avoidance technique. IEEE Transactions, on Computers, 39(7), 1990.
5. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Proceedings of the European Symposium on Algorithms, pages 152-164, 2002.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. MIT Press, 2001.
7. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the ACM Symposium on the Theory of Computing, pages 365-372, May 1987.
8. B. Haeupler, T. Kavitha, R. Mathew, S. Sen, and R. E. Tarjan. Faster algorithms for incremental topological ordering. In Proceedings of the 35th International Colloquium on Automata, Languages, and Programming, July 2008.
9. B. Haeupler, S. Sen, and R. E. Tarjan. Incremental topological ordering and strong component maintenance. CoRR, abs/0803.0792, 2008.
10. I. Katriel. On algorithms for online topological ordering and sorting. Technical Report MPI-I-2004-1-003, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 2004.
11. I. Katriel and H. L. Bodlaender. Online topological ordering. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pages 443-450, Vancouver, British Columbia, Canada, January 2005.
12. T. Kavitha and R. Mathew. Faster algorithms for online topological ordering. CoRR, abs/0711.0251, 2007.
13. H.-F. Liu and K.-M. Chao. A tight analysis of the katriel-bodlaender algorithm for online topological ordering. Theoretical Computer Science, 389(1-2):182-189, 2007. (Pubitemid 350087461)
14. A. Marchetti-Spaccamela, U. Nanni, and H. Rohnert. On-line graph algorithms for incremental compilation. In Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 70-86, June 1993.
15. A. Marchetti-Spaccamela, U. Nanni, and H. Rohnert. Maintaining a topological order under edge insertions. Information Processing Letters, 59(1):53-58, 1996. (Pubitemid 126375575)
16. S. M. Omohundro, C. Lim, and J. Bilmes. The sather language compiler/debugger implementation. Technical report, International Computer Science Institute, Berkeley. March 1992.
17. D. Pearce, P. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. In Proceedings of the 3rd International Workshop on Source Code Analysis and Manipulation, pages 3-12, Sept. 2003.
18. D. J. Pearce and P. H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proceedings of the 3rd International Workshop on Efficient Experimental Algorithms, volume 3059 of Lecture Notes in Computer Science, pages 383-398. Springer, 2004.
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. (Pubitemid 124013184)