An script O sign (n2.75) algorithm for online topological ordering

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

Volumn 4059 LNCS, Issue , 2006, Pages 53-64

  Ajwani, Deepak ^a   Friedrich, Tobias ^a   Meyer, Ulrich ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; ONLINE SYSTEMS; TOPOLOGY;

DIRECTED ACYCLIC GRAPH; ONLINE EDGE INSERTION SEQUENCE; TOPOLOGICAL ORDERING;

GRAPH THEORY;

EID: 33746401969     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_8     Document Type: Conference Paper

References (11)

1. 2.75) algorithm for online topological ordering, 2006. arXiv:cs.DS/0602073.
2. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. Kenneth Zadeck. Incremental evaluation of computational circuits. In Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms, pages 32-42, Philadelphia, PA, USA, 1990. Society for Industrial and Applied Mathematics.
3. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1989.
4. I. Katriel and H.L. Bodlaender. Online topological ordering. In Proceeding of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), Vancouver, pages 443-450, 2005.
5. A. Marchetti-Spaccamela, U. Nanni, and H. Rohnert. On-line graph algorithms for incremental compilation. In Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science (WG 93), volume 790 of Lecture Notes in Computer Science, pages 70-86, 1993.
6. A. Marchetti-Spaccamela, U. Nanni, and H. Rohnert. Maintaining a topological order under edge insertions. Information Processing Letters, 59(1):53-58, July 1996.
7. S. M. Omohundro, C. Lim, and J. Bilmes. The sather language compiler/debugger implementation. Technical Report TR-92-017, International Computer Science Institute, Berkeley, 1992.
8. A. Östlin and R. Pagh. Uniform hashing in constant time and linear space. In Proceedings of the 35th Annual ACM symposium on theory of computing, pages 622-628. ACM, 2003.
9. D. J. Pearce and P. H. J. Kelly. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proceedings of the Workshop on Efficient and experimental Algorithms, volume 3059 of Lecture Notes in Computer Science, pages 383-398. Springer-Verlag, 2004.
10. D. J. Pearce, P. H. J. Kelly, and C. Hankin. Online cycle detection and difference propagation for pointer analysis. In Proceedings of the third international IEEE Workshop on Source Code Analysis and Manipulation (SCAM03), 2003.
11. G. Ramalingam and T. W. Reps. On competitive on-line algorithms for the dynamic priority-ordering problem. Information Processing Letters, 51:155-161, 1994.