Average-case analysis of online topological ordering

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

Volumn 4835 LNCS, Issue , 2007, Pages 464-475

  Ajwani, Deepak ^a   Friedrich, Tobias ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EDGE DETECTION; PROBLEM SOLVING; TOPOLOGY;

AVERAGE-CASE ANALYSIS; TOPOLOGICAL ORDERING; WORST-CASE BOUND;

ONLINE SYSTEMS;

EID: 38149074747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_41     Document Type: Conference Paper

References (25)

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: Proc. of SODA 1990, pp. 32-42 (1990)
3. Ausiello, G., Italiano, G.F., Marchetti-Spaccamela, A., Nanni, U.: Incremental algorithms for minimal length paths. J. Algorithms 12(4), 615-638 (1991)
4. Barak, A.B., Erdös, P.: On the maximal number of strongly independent vertices in a random acyclic directed graph. SIAM Journal on Algebraic and Discrete Methods 5(4), 508-514 (1984)
5. Bollobás, B.: Random Graphs. Cambridge Univ. Press, Cambridge (2001)
6. Cicerone, S., Frigioni, D., Nanni, U., Pugliese, F.: A uniform approach to semidynamic problems on digraphs. Theor. Comput. Sci. 203(1), 69-90 (1998)
7. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1989)
8. Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: Proc. of STOC 1987, pp. 365-372 (1987)
9. Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: Atallah, M.J. (ed.) Algorithms and Theory of Computation Handbook, ch. 8, CRC Press (1999)
10. Erdös, P., Rényi, A.: On random graphs. Publ. Math. Debrecen. 6, 290-297 (1959)
11. Erdös, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutato Int. Kozl 5, 17-61 (1960)
12. Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 320-331. Springer, Heidelberg (1998)
13. Katriel, I., Bodlaender, H.L.: Online topological ordering. ACM Trans. Algorithms 2(3), 364-379 (2006) Preliminary version appeared as [14]
14. Katriel, I., Bodlaender, H.L.: Online topological ordering. In: Proc. of SODA 2005, pp. 443-450 (2005)
15. 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)
16. Marchetti-Spaccamela, A., Nanni, U., Rohnert, H.: Maintaining a topological order under edge insertions. Information Processing Letters 59(1), 53-58 (1996)
17. Omohundro, S.M., Lim, C.-C., Bilmes, J.: The sather language compiler/debugger implementation. Technical Report 92-017, International Computer Science Institute, Berkeley (1992)
18. Pearce, D.J., Kelly, P.H.J.: A dynamic topological sort algorithm for directed acyclic graphs. J. Exp. Algorithmics 11(1.7) (2006) Preliminary version appeared as [19]
19. Pearce, D.J., Kelly, P.H.J.: A dynamic algorithm for topologicals/ sorting directed acyclic graphs. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 383-398. Springer, Heidelberg (2004)
20. Pearce, D.J., Kelly, P.H.J., Hankin, C.: Online cycle detection and difference propagation: Applications to pointer analysis. Software Quality Journal 12(4), 311-337 (2004)
21. Pittel, B., Tungol, R.: A phase transition phenomenon in a random directed acyclic graph. Random Struct. Algorithms 18(2), 164-184 (2001)
22. Ramalingam, G., Reps, T.W.: On competitive on-line algorithms for the dynamic priority-ordering problem. Information Processing Letters 51, 155-161 (1994)
23. Ramalingam, G., Reps, T.W.: On the computational complexity of dynamic graph problems. Theor. Comput. Sci. 158(1-2), 233-277 (1996)
24. Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In: Proc. of STOC 2004, pp. 184-191 (2004)
25. Roditty, L., Zwick, U.: On dynamic shortest paths problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 580-591. Springer, Heidelberg (2004)