On certificates and lookahead in dynamic graph problems

Algorithmica (New York)

Volumn 21, Issue 4, 1998, Pages 377-394

  Khanna, S ^a   Motwani, R ^b   Wilson, R H ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b Stanford University   (United States)

^c SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Dynamic algorithms; Graph algorithms; Graph certificates; Lookahead algorithms; Sparsification; Strong connectivity; Transitive closure

Indexed keywords

EID: 0005269485     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009220     Document Type: Article

References (31)

1. R. Agrawal and H.V. Jagdish. Materialization and incremental update of path information. In Proceedings of the Fifth International IEEE Conference on Data Engineering (1989), pp. 374-383.
2. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
3. S. Albers. The Influence of Lookahead in Competitive On-Line Algorithms. Technical Report MPI-I-92-143, Max Planck Institute, Saarbrücken, 1993.
4. J.A. Blakaley, P.-A. Larson, and F.W. Tompa. Efficiently updating materialized views. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (1986), pp. 61-71.
5. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9:1-6 (1990).
6. Y. Dai, H. Imai, K. Iwano, and N. Katoh. How to treat delete requests in semi-online problems. In Proceedings of the 4th International Symposium on Algorithms and Computation (1993), pp. 48-57.
7. H. Edelsbrunner, and M.H. Overmars. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms, 6:515-542 (1985).
8. D. Eppstein. Offline algorithms for dynamic minimum spanning tree problems. Journal of Algorithms, 17:237-250 (1994).
9. D. Eppstein, Z. Galil, G.F. Italiano, and A. Nissenzweig. Sparsification - a technique for speeding up dynamic graph algorithms. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (1992), pp. 60-69.
10. D. Eppstein, Z. Galil, G.F. Italiano, and A. Nissenzweig. Sparsification - A Technique for Speeding Up Dynamic Graph Algorithms. Technical Report RC 19272 (83907), IBM, Yorktown Heights, NY, 1993.
11. G.N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal on Computing, 14:781-798 (1985).
12. G.N. Frederickson. Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science (1991), pp. 632-641.
13. Z. Galil and G.F. Italiano. Fully dynamic algorithms for edge-connectivity problems. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (1991), pp. 317-327.
14. E. Hanson. A performance analysis of view materialization strategies. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (1987), pp. 440-453.
15. L. Hellerstein, P. Klein, and R. Wilber. On the time-space complexity of reachability queries for preprocessed graphs. Information Processing Letters, 35:261-267 (1990).
16. M.R. Henzinger and V. King. Randomized dynamic algorithms with polylogarithmic time per operation. In Proceedings of the 21th Annual ACM Symposium on Theory of Computing (1995), pp. 519-527.
17. M.R. Henzinger and V. King. Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (1995), pp. 664-672.
18. L.S. Homem de Mello and S. Lee (editors). Computer-Aided Mechanical Assembly Planning. Kluwer, Dordrecht, 1991.
19. H.V. Jagdish. A compression technique to materialize transitive closure. ACM Transactions on Database Systems, 15:558-598 (1990).
20. E. Koutsoupias and C.H. Papadimitriou. Beyond competitive analysis. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (1994), pp. 394-400.
21. R. Motwani, V. Saraswat, and E. Torng. Online Scheduling with Lookahead: Multipass Assembly Lines. Report CPS-94-41, Department of Computer Science, Michigan State University, East Lansing, MI, 1994.
22. M. Rauch. Fully dynamic biconnectivity in graphs. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (1992), pp. 50-59.
23. A. Schaeffer and P. Varman. Parallel Batch Update of Minimum Spanning Trees. Technical Report COMP TR90-140, Rice University, Houston, TX, 1990.
24. A. Segev and J. Park. Maintaining views in distributed databases. In Proceedings of the Fifth International IEEE Conference on Data Engineering (1989), pp. 262-270.
25. O. Shmueli and A. Itai. Maintenance of views. In Proceedings of the ACM-SIGMOD International Conference on Management of Data (1984), pp. 240-255.
26. V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 14:354-356 (1969).
27. J. Westbrook and R.E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433-464 (1992).
28. R.H. Wilson. On Geometric Assembly Planning. Ph.D. thesis, Technical Report STAN-CS-92-1416, Stanford University, Stanford, CA, 1992.
29. R.H. Wilson and J-C. Latombe. Geometric reasoning about mechanical assembly. Artificial Intelligence, 71:371-396 (1994).
30. J.D. Wolter. On the Automatic Generation of Plans for Mechanical Assembly. Ph.D. thesis, University of Michigan, Ann Arbor, MI, 1988.
31. M. Yannakakis. Graph-theoretic methods in database theory. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (1990), pp. 230-242.