On certificates and lookahead in dynamic graph problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 222-231

  Khanna, Sanjeev ^a   Motwani, Rajeev ^a   Wilson, Randall H ^b  

^a Stanford University   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOT PROGRAMMING;

ASSEMBLY PLANNING; DETERMINISTIC ALGORITHMS; DYNAMIC GRAPH ALGORITHMS; FULLY DYNAMIC ALGORITHMS; INHERENT COMPLEXITY; MAXIMUM MATCHINGS; STRONG CONNECTIVITY; TRANSITIVE CLOSURE;

DIRECTED GRAPHS;

EID: 33645253879     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. R. Agrawal and H.V. Jagdish. Materialization and Incremental Update of Path Information. In Proceedings of 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, 1974.
3. S. Albers. The influence of lookahead in competitive on-line algorithms. Technical Report MPI-I-92-143, Max Planck Institute, Germany, 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. Tech. Rep. RC 19272(83907), IBM (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. Rauch Henzinger and V. King. Randomized Dynamic Algorithms with Polylogarithmic Time per Operation. In Proceedings of the 27th Annual A CM Symposium on Theory of Computing (1995), pp. 519-527.
17. M. Rauch 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. Hornem de Mello and S. Lee (editors). Computer-Aided Mechanical Assembly Planning. Kluwer, 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, 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, 1990.
24. A. Segev and J. Park. Maintaining Views in Distributed Databases. In Proceedings of Fifth International IEEE Conference on Data Engineering (1989), pp. 262-270.
25. O. Shmueli and A. Itai. Maintenance of Views. In Proceedings of the A CM-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. PhD thesis, Stanford University, 1992. Stanford Technical Report STAN-CS-92-1416.
29. R.H. Wilson and J-C. Latombe. Geometric reasoning about mechanical assembly. Artificial Intelligence, 71 (1994).
30. J.D. Wolter. On the Automatic Generation of Plans for Mechanical Assembly. PhD thesis, University of Michigan, 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-42.