On-line and Dynamic Shortest Paths through Graph Decompositions (Preliminary Version)

We describe algorithms for finding shortest paths and distances in a planar digraph which exploit the particular topology of the input graph. We give both sequential and parallel algorithms that work on a dynamic environment, where the cost of any edge can be changed or the edge can be deleted. For outerplanar digraphs, for instance, the data structures can be updated after any such change in only O(log n) time, where n is the number of vertices of the digraph. The parallel algorithms presented here are the first known ones for solving this problem. Our results can be extended to hold for digraphs of genus o(n).

[1]  Greg N. Fredericicson.  Planar Graph Decomposition and All Pairs Shortest Paths , 1991 .

[2]  Shimon Even,et al.  Updating distances in dynamic graphs , 1985 .

[3]  Jeffery R. Westbrook.  Algorithms and data structures for dynamic graph problems , 1989 .

[4]  Andrzej Lingas,et al.  Efficient Parallel Algorithms for Path Problems in Planar Directed Graphs , 1990, SIGAL International Symposium on Algorithms.

[5]  Alberto Marchetti-Spaccamela,et al.  Dynamic algorithms for shortest paths in planar graphs , 1993, Theor. Comput. Sci..

[6]  Paul G. Spirakis,et al.  Efficient parallel algorithms for shortest paths in planar digraphs , 1992, BIT Comput. Sci. Sect..

[7]  Edith Cohen.  Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition , 1996, J. Algorithms.

[8]  Roberto Tamassia,et al.  On-line maintenance of the four-connected components of a graph , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[9]  La Poutre,et al.  Alpha-algorithms for incremental planarity testing , 1994 .

[10]  J. Spencer.  Probabilistic Methods in Combinatorics , 1974 .

[11]  Philip N. Klein,et al.  A linear-processor polylog-time algorithm for shortest paths in planar graphs , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Barbara G. Ryder,et al.  Incremental data flow analysis via dominator and attribute update , 1988, POPL '88.

[13]  Gary L. Miller,et al.  A parallel algorithm for finding a separator in planar graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[15]  Grammati E. Pantziou,et al.  Computing Shortest Paths and Distances in Planar Graphs , 1991, ICALP.

[16]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[17]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

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

[19]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[20]  David Eppstein,et al.  Sparsification-a technique for speeding up dynamic graph algorithms , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

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

[22]  Greg N. Frederickson,et al.  Using cellular graph embeddings in solving all pairs shortest paths problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[23]  Barbara G. Ryder,et al.  Data flow update via dominator and attribute updates , 1988 .