On Certificates and Lookahead in Dynamic Graph Problems

Abstract. Recent work in dynamic graph algorithms has led to efficient algorithms for dynamic undirected graph problems such as connectivity. However, no efficient deterministic algorithms are known for the dynamic versions of fundamental directed graph problems like strong connectivity and transitive closure, as well as some undirected graph problems such as maximum matchings and cuts. We provide some explanation for this lack of success by presenting quadratic lower bounds on the certificate complexity of the seemingly difficult problems, in contrast to the known linear certificate complexity for the problems which have efficient dynamic algorithms. In many applications of dynamic (di)graph problems, a certain form of lookahead is available. Specifically, we consider the problems of assembly planning in robotics and the maintenance of relations in databases. These give rise to dynamic strong connectivity and dynamic transitive closure problems, respectively. We explain why it is reasonable, and indeed natural and desirable, to assume that lookahead is available in these two applications. Exploiting lookahead to circumvent their inherent complexity, we obtain efficient dynamic algorithms for strong connectivity and transitive closure.

[1]  Rajeev Motwani,et al.  Online Scheduling with Lookahead: Multipass Assembly Lines , 1998, INFORMS J. Comput..

[2]  Ronald L. Rivest,et al.  The Design and Analysis of Computer Algorithms , 1990 .

[3]  Frank Wm. Tompa,et al.  Eeciently Updating Materialized Views , 1986 .

[4]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[5]  H.V. Jagadish,et al.  Materialization and incremental update of path information , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[6]  Jean-Claude Latombe,et al.  Geometric Reasoning About Mechanical Assembly , 1994, Artif. Intell..

[7]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[8]  Oded Shmueli.  Itai maintenance of views , 1984 .

[9]  Richard A. Volz,et al.  On the automatic generation of plans for mechanical assembly , 1988 .

[10]  V. Strassen.  Gaussian elimination is not optimal , 1969 .

[11]  Alon Itai,et al.  Maintenance of views , 1984, SIGMOD '84.

[12]  Sukhan Lee,et al.  Computer-Aided Mechanical Assembly Planning , 1991 .

[13]  Philip N. Klein,et al.  On the Time-Space Complexity of Reachability Queries for Preprocessed Graphs , 1990, Inf. Process. Lett..

[14]  Hiroshi Imai,et al.  How to Treat Delete Requests in Semi-Online Problems , 1993, International Symposium on Algorithms and Computation.

[15]  Eric N. Hanson,et al.  A performance analysis of view materialization strategies , 1987, SIGMOD '87.

[16]  Greg N. Frederickson,et al.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  H. V. Jagadish,et al.  A compression technique to materialize transitive closure , 1990, TODS.

[18]  Mihalis Yannakakis,et al.  Graph-theoretic methods in database theory , 1990, PODS.

[19]  David Eppstein,et al.  Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.

[20]  Greg N. Frederickson,et al.  Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[21]  David Eppstein,et al.  Offline Algorithms for Dynamic Minimum Spanning Tree Problems , 1991, J. Algorithms.

[22]  Monika Henzinger,et al.  Fully dynamic biconnectivity and transitive closure , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[23]  Frank Wm. Tompa,et al.  Efficiently updating materialized views , 1986, SIGMOD '86.

[24]  Mark H. Overmars,et al.  Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.

[25]  Zvi Galil,et al.  Fully dynamic algorithms for edge connectivity problems , 1991, STOC '91.

[26]  Monika Henzinger,et al.  Randomized dynamic graph algorithms with polylogarithmic time per operation , 1995, STOC '95.

[27]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[28]  Randall H. Wilson,et al.  On geometric assembly planning , 1992 .