Incremental cycle detection, topological ordering, and strong component maintenance

ACM Transactions on Algorithms

Volumn 8, Issue 1, 2012, Pages

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

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^c INDIAN INSTITUTE OF SCIENCE   (India)

^d Princeton University   (United States)

^e HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Arrangement; Cycle detection; Directed graphs; Dynamic algorithms; Halving intersection; Strong components; Topological order

Indexed keywords

ARRANGEMENT; CYCLE DETECTION; DIRECTED GRAPHS; DYNAMIC ALGORITHMS; STRONG COMPONENTS; TOPOLOGICAL ORDER;

GRAPH THEORY; MAINTENANCE;

ALGORITHMS;

EID: 84857148539     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2071379.2071382     Document Type: Conference Paper

References (52)

1. AHO, A. V. , HOPCROFT, J. E. , AND ULLMAN, J. D. 1983. Data Structures and Algorithms. Addison-Wesley.
2. AJWANI, D. 2008. Traversing large graphs in realistic settings. Ph. D. thesis, Universität des Saarlandes, Saarbrücken, Germany.
3. AJWANI, D. , FRIEDRICH, T. , AND MEYER, U. 2006. An O(n2. 75) algorithm for online topological ordering. In Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT). 53-64. (Pubitemid 44123960)
4. ALPERN, B. , HOOVER, R. , ROSEN, B. K. , SWEENEY, P. F. , AND ZADECK, F. K. 1990. Incremental evaluation of computational circuits. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA). 32-42.
5. BELIK, F. 1990. An efficient deadlock avoidance technique. IEEE Trans. Comput. 39, 7, 882-888.
6. 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 Proceedings of the 10th European Symposium on Algorithms (ESA). 152-164.
7. BENDER, M. A. , FINEMAN, J. T. , AND GILBERT, S. 2009. A new approach to incremental topological ordering. In Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). 1108-1115.
8. BLUM, M. , FLOYD, R. W. , PRATT, V. , RIVEST, R. L. , AND TARJAN, R. E. 1973. Time bounds for selection. J. Comput. Syst. Sci. 7, 4, 448-461.
9. CHERIYAN, J. AND MEHLHORN, K. 1996. Algorithms for dense graphs and networks on the random access computer. Algorithmica 15, 6, 521-549. (Pubitemid 126422531)
10. DEY, T. K. 1998. Improved bounds for planar k-sets and related problems. Disc. Comput. Geom. 19, 3, 373-382.
11. DIETZ, P. F. AND SLEATOR, D. D. 1987. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing (STOC). 365-372.
12. DOR, D. AND ZWICK, U. 1999. Selecting the median. SIAM J. Comput. 28, 5, 1722-1758. (Pubitemid 129304149)
13. GABOW, H. N. 2000. Path-based depth-first search for strong and biconnected components. Inf. Proc. Lett. 74, 3-4, 107-114.
14. HAEUPLER, B. , KAVITHA, T. , MATHEW, R. , SEN, S. , AND TARJAN, R. E. 2008a. Faster algorithms for incremental topological ordering. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP). 421-433.
15. HAEUPLER, B. , SEN, S. , AND TARJAN, R. E. 2008b. Incremental topological ordering and strong component maintenance. http://arxiv.org/abs/0803. 0792.
16. HAN, Y. AND THORUP, M. 2002. Integer sorting in O(n-log log n) expected time and linear space. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). 135-144.
17. HARARY, F. , NORMAN, R. Z. , AND CARTWRIGHT, D. 1965. Structural Models : An Introduction to the Theory of Directed Graphs. Wiley.
18. HOARE, C. A. R. 1961. Algorithm 65: Find. Comm. ACM 4, 7, 321-322.
19. KATRIEL, I. 2004. On algorithms for online topological ordering and sorting. Tech. rep. MPI-I-2004-1-003, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
20. KATRIEL, I. AND BODLAENDER, H. L. 2006. Online topological ordering. ACM Trans. Algor. 2, 3, 364-379. (Pubitemid 44452177)
21. KAVITHA, T. AND MATHEW, R. 2007. Faster algorithms for online topological ordering. http://arxiv.org/abs/0711. 0251.
22. KNUTH, D. E. 1972. Mathematical analysis of algorithms. In Proceedings of the IFIP Congress. 19-27.
23. KNUTH, D. E. 1973. The Art of Computer Programming. Vol. 1: Fundamental Algorithms. Addison-Wesley.
24. KNUTH, D. E. AND SZWARCFITER, J. L. 1974. A structured program to generate all topological sorting arrangements. Inf. Proc. Lett. 2, 6, 153-157.
25. LIU, H.-F. AND CHAO, K.-M. 2007. A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering. Theor. Comput. Sci. 389, 1-2, 182-189. (Pubitemid 350087461)
26. LIU, H.-F. AND CHAO, K.-M. 2008. An O (n2. 5)-time algorithm for online topological ordering. http://arxiv.org/abs/0804. 3860.
27. MARCHETTI-SPACCAMELA, A. , NANNI, U. , AND ROHNERT, H. 1993. On-line graph algorithms for incremental compilation. In Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG). 70-86.
28. MARCHETTI-SPACCAMELA, A. , NANNI, U. , AND ROHNERT, H. 1996. Maintaining a topological order under edge insertions. Inf. Proc. Lett. 59, 1, 53-58. (Pubitemid 126375575)
29. NIVASCH, G. 2008. An improved, simple construction of many halving edges. In Surveys on Discrete and Computational Geometry: Twenty Years Later. AMS, 299-305.
30. OMOHUNDRO, S. M. , LIM, C.-C. , AND BILMES, J. 1992. The Sather language compiler/debugger implementation. Tech. rep. TR-92-017, International Computer Science Institute, Berkeley.
31. PEARCE, D. J. 2005. Some directed graph algorithms and their application to pointer analysis. Ph. D. thesis, University of London, London, UK.
32. PEARCE, D. J. AND KELLY, P. H. J. 2003. Online algorithms for topological order and strongly connected components. http://homepages.ecs.vuw.ac.nz/-djp/ files/tr0903.pdf
33. PEARCE, D. J. AND KELLY, P. H. J. 2006. A dynamic topological sort algorithm for directed acyclic graphs. J. Exp. Algorithmics 11, 1. 7.
34. PEARCE, D. J. AND KELLY, P. H. J. 2007. A dynamic batch algorithm for maintaining a topological order. Tech. rep. , Victoria University, Wellington, New Zealand.
35. PEARCE, D. J. , KELLY, P. H. J. , AND HANKIN, C. 2003. Online cycle detection and difference propagation for pointer analysis. In Proceedings of the IEEE Workshop on Source Code Analysis and Manipulation (SCAM). 3-12.
36. RAMALINGAM, G. AND REPS, T. W. 1991. On the computational complexity of incremental algorithms. Tech. rep. CS-TR-1991-1033, University of Wisconsin-Madison.
37. RAMALINGAM, G. AND REPS, T. W. 1994. On competitive on-line algorithms for the dynamic priorityordering problem. Inf. Proc. Lett. 51, 3, 155-161. (Pubitemid 124013184)
38. RODITTY, L. AND ZWICK, U. 2008. Improved dynamic reachability algorithms for directed graphs. SIAM J. Comput. 37, 5, 1455-1471.
39. SCHÖNHAGE, A. , PATERSON, M. , AND PIPPENGER, N. 1976. Finding the median. J. Comput. Syst. Sci. 13, 2, 184-199. (Pubitemid 8036930)
40. SHARIR, M. 1981. A strong-connectivity algorithm and its applications in data flow analysis. Comput. Math. App. 7, 1, 67-72.
41. SHARIR, M. AND SMORODINSKY, S. 2003. Extremal configurations and levels in pseudoline arrangements. In Proceedings of the 8th International Workshop on Algorithms and Data Structures (WADS). 127-139.
42. SHMUELI, O. 1983. Dynamic cycle detection. Inf. Proc. Lett. 17, 4, 185-188.
43. SZPILRAJN, E. 1930. Sur l'extension de l'ordre partiel. Fund. Math. 16, 386-389.
44. TAMAKI, H. AND TOKUYAMA, T. 2003. A characterization of planar graphs by pseudo-line arrangements. Algorithmica 35, 3, 269-285.
45. TARJAN, R. E. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 2, 146-160.
46. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2, 215-225.
47. TARJAN, R. E. AND VAN LEEUWEN, J. 1984. Worst-case analysis of set union algorithms. J. ACM 31, 2, 245-281.
48. THORUP, M. 2004. Integer priority queues with decrease key in constant time and the single source shortest paths problem. J. Comput. Syst. Sci. 69, 3, 330-353.
49. TÓTH, G. 2001. Point sets with many k-sets. Discrete Comput. Geom. 26, 2, 187-194.
50. VAN EMDE BOAS, P. 1977. Preserving order in a forest in less than logarithmic time and linear space. Inf. Proc. Lett. 6, 3, 80-82.
51. VAN EMDE BOAS, P. , KAAS, R. , AND ZIJLSTRA, E. 1977. Design and implementation of an efficient priority queue. Math. Syst. Theory 10, 99-127.
52. ZWICK, U. 1986. Allowable circular sequences and their application (in Hebrew). M. S. thesis, Tel-Aviv University, Tel-Aviv, Israel.