Faster algorithms for incremental topological ordering

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 421-433

  Haeupler, Bernhard ^a   Kavitha, Telikepalli ^b   Mathew, Rogers ^b   Sen, Siddhartha ^a   Tarjan, Robert E ^a,c  

^a PRINCETON UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY; TRANSLATION (LANGUAGES);

DIRECTED ACYCLIC GRAPH; ON-LINE ALGORITHMS; TOPOLOGICAL ORDER; TOPOLOGICAL ORDERING;

LINGUISTICS;

EID: 49049084644     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_35     Document Type: Conference Paper

References (31)

1. 2.75) algorithm for online topological ordering. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 53-64. Springer, Heidelberg (2006)
2. Alpern, B., Hoover, R., Rosen, B.K., Sweeney, P.F., Zadeck, F.K.: Incremental evaluation of computational circuits. In: SODA 1990, pp. 32-42 (1990)
3. Belik, F.: An efficient deadlock avoidance technique. IEEE Trans. on Comput. 39(7) (1990)
4. Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 152-164. Springer, Heidelberg (2002)
5. Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. of Comput. and Syst. Sci. 7(4), 448-461 (1973)
6. Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: STOC 1987, pp. 365-372 (1987)
7. Haeupler, B., Sen, S., Tarjan, R.E.: Incremental topological ordering and strong component maintenance (2008)
8. Han, Y., Thorup, M.: Integer sorting in O(n√log log n) expected time and linear space. In: FOCS 2002, pp. 135-144 (2002)
9. Harary, F., Norman, R.Z., Cartwright, D.: Structural Models : An Introduction to the Theory of Directed Graphs. John Wiley & Sons, Chichester (1965)
10. Katriel, I.: On algorithms for online topological ordering and sorting. Technical Report MPII-2004-1-003, Max-Planck-Institut für Informatik, Saarbrücken, Germany (2004)
11. Katriel, I., Bodlaender, H.L.: Online topological ordering. ACM Trans. on Algor. 2(3), 364-379 (2006)
12. Kavitha, T., Mathew, R.: Faster algorithms for online topological ordering (2007)
13. Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol. 1. Addison-Wesley, Reading (1973)
14. Knuth, D.E., Szwarcfiter, J.L.: A structured program to generate all topological sorting arrangements. Inf. Proc. Lett. 2(6), 153-157 (1974)
15. Liu, H.-F., Chao, K.-M.: A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. Theor. Comput. Sci. 389(1-2), 182-189 (2007)
16. 2.5)-time algorithm for online topological ordering (2008)
17. Marchetti-Spaccamela, A., Nanni, U., Rohnert, H.: On-line graph algorithms for incremental compilation. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol. 790, pp. 70-86. Springer, Heidelberg (1994)
18. Marchetti-Spaccamela, A., Nanni, U., Rohnert, H.: Maintaining a topological order under edge insertions. Inf. Proc. Lett. 59(1), 53-58 (1996)
19. Omohundro, S.M., Lim, C.-C., Bilmes, J.: The Sather language compiler/debugger implementation. Technical Report TR-92-017, International Computer Science Institute, Berkeley (1992)
20. Pearce, D.J., Kelly, P.H.J.: A dynamic topological sort algorithm for directed acyclic graphs. J. of Exp. Algorithmics 11, 1-7 (2006)
21. Pearce, D.J., Kelly, P.H.J., Hankin, C.: Online cycle detection and difference propagation for pointer analysis. In: SCAM 2003, pp. 3-12 (2003)
22. Ramalingam, G., Reps, T.W.: On the computational complexity of incremental algorithms. Technical Report CS-TR-1991-1033, University of Wisconsin-Madison (1991)
23. Ramalingam, G., Reps, T.W.: On competitive on-line algorithms for the dynamic priority-ordering problem. Inf. Proc. Lett. 51(3), 155-161 (1994)
24. Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. In: FOCS 2002, pp. 679-688 (2002)
25. Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: STOC 2004, pp. 184-191 (2004)
26. Schönhage, A., Paterson, M., Pippenger, N.: Finding the median. J. of Comput. and Syst. Sci. 13(2), 184-199 (1976)
27. Shmueli, O.: Dynamic cycle detection. Information Processing Letters 17(4), 185-188 (1983)
28. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. on Comput. 1(2), 146-160 (1972)
29. Thorup, M.: Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. of Comput. Syst. Sci. 69(3), 330-353 (2004)
30. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Lett. 6(3), 80-82 (1977)
31. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory 10, 99-127 (1977)