A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering

Theoretical Computer Science

Volumn 389, Issue 1-2, 2007, Pages 182-189

  Liu, Hsiao Fei ^a   Chao, Kun Mao ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Online algorithms; Tight analysis; Topological order

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; GRAPH THEORY; ONLINE SYSTEMS;

KATRIEL-BODLAENDER ALGORITHMS; ONLINE ALGORITHMS; TIGHT ANALYSIS; TOPOLOGICAL ORDER;

ALGORITHMS;

EID: 36049045045     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.08.009     Document Type: Article

References (15)

1. 2.75) algorithm for online topological ordering, in: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), 2006, pp. 53-64
2. Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck, Incremental evaluation of computational circuits, in: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, pp. 32-42
3. Michael A. Bender, Richard Cole, Erik D. Demaine, Martin Farach-Colton, Jack Zito, Two simplified algorithms for maintaining order in a list, in: Proceedings of the 10th Annual European Symposium on Algorithms (ESA), 2002, pp. 152-164
4. Paul F. Dietz, Daniel D. Sleator, Two Algorithms for maintaining order in a list, in: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), 1987, pp. 365-372
5. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34 3 (1987) 596-615
6. Irit Katriel, On algorithms for online topological ordering and sorting, Research Report MPI-I-2004-1-003, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 2004
7. Katriel I., and Bodlaender H.L. Online topological ordering. ACM Transactions on Algorithms 2 3 (2006) 364-379
8. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert, On-line graph algorithms for incremental compilation, in: Proceeding of International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 1993, pp. 70-86
9. Marchetti-Spaccamela A., Nanni U., and Rohnert H. Maintaining a topological order under edge insertions. Information Processing Letters 59 1 (1996) 53-58
10. Laurent Michel, Pascal Van Hentenryck, A constraint-based architecture for local search, in: Proceedings of the 17th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2002, pp. 83-100
11. Stephen M. Omohundro, Chu-Cheow Lim, Jeff Bilmes, The sather language compiler/debugger implementation, Technical Report TR-92-017, International Computer Science Institute, Berkley, 1992
12. David J. Peace, Some directed graph algorithms and their application to pointer analysis, Ph.D. Thesis, Imperial College of Science, Technology and Medicine, University of London, 2005
13. Pearce D.J., Kelly P.H.J., and Hankin C. Online cycle detection and difference propagation: Applications to pointer analysis. Software Quality Journal 12 4 (2004) 309-335
14. Pearce D.J., and Kelly P.H.J. A dynamic algorithm for topologically sorting directed acyclic graphs. ACM Journal of Experimental Algorithms 11 1.7 (2007) 1-24
15. Ramalingam G., and Reps T.W. On competitive on-line algorithms for the dynamic priority-ordering problem. Information Processing Letters 51 3 (1994) 155-161