Online topological ordering

ACM Transactions on Algorithms

Volumn 2, Issue 3, 2006, Pages 364-379

  Katriel, Irit ^a   Bodlaender, Hans L ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Dynamic algorithms; Graphs; Online algorithms; Topological order; Treewidth

Indexed keywords

DYNAMIC ALGORITHMS; ONLINE ALGORITHMS; TOPOLOGICAL ORDER; TREEWIDTH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 33748991997     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1159892.1159896     Document Type: Article

References (15)

1. ALPERN, B., HOOVER, R., ROSEN, B. K., SWEENEY, P. F., AND ZADECK, F. K. 1990. Incremental evaluation of computational circuits. In SODA '90: Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 32-42.
2. BENDER, M. A., COLE, R., DEMAINE, E. D., FARACH-COLTON, M., AND ZITO, J. 2002. Two simplified algorithms for maintaining order in a list. In ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms (London, UK). Springer-Verlag, New York, 152-164.
3. BODLAENDER, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209, 1-45.
4. DIETZ, P., AND SLEATOR, D. 1987. Two algorithms for maintaining order in a list. In STOC '87: Proceedings of the 19th Annual ACM Conference on Theory of Computing. ACM, New York, 365-372.
5. FREDMAN, M. L., AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
6. KATRIEL, I. 2004. On algorithms for online topological ordering and sorting. Res. Rep. MPI-1-2004-1-003, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
7. MARCHETTI-SPACCAMELA, A., NANNI, U., AND ROHNERT, H. 1994. On-line graph algorithms for incremental compilation. In WC '93: Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (London, UK). Springer-Verlag, New York, 70-86.
8. MARCHETTI-SPACCAMELA, A., NANNI, U., AND ROHNERT, H. 1996. Maintaining a topological order under edge insertions. Inf. Proc. Lett. 59, 1, 53-58.
9. MICHEL, L., AND VAN HENTENRYCK, P. 2002. A constraint-based architecture for local search. In OOPSLA '02: Proceedings of the 17th ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications. ACM, New York, 83-100.
10. OMOHUNDRO, S., LIM, C., AND BILMES, J. 1992. The Sather language compiler/debugger implementation. Tech. Rep. TR-92-017, International Computer Science Institute, Berkeley, CA, March.
11. PEARCE, D. J., AND KELLY, P. H. J. 2004. A dynamic algorithm for topologically sorting directed acyclic graphs. In Proceedings of the Workshop on Efficient and Experimental Algorithms. Lecture Notes in Computer Science, vol. 3059. Springer-Verlag, London, UK, 383-398.
12. RAMALINGAM, G., AND REPS, T. 1994. On competitive on-line algorithms for the dynamic priority-ordering problem. Inf. Proc. Lett. 51, 3, 155-161.
13. RAMALINGAM, G., AND REPS, T. 1996. On the computational complexity of dynamic graph problems. Theoret. Comput. Sci. 158, 1-2, 233-277.
14. ROBERTSON, N., AND SEYMOUR, P. D. 1986. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7, 309-322.
15. TARJAN, R. E. 1972. Depth first search and linear graph algorithms. SIAM J. Comput. 1, 2 (June), 146-160.