An Incremental Algorithm for a Generalization of the Shortest-Path Problem

Thegrammar problem, a generalization of the single-source shortest-path problem introduced by D. E. Knuth (Inform. Process. Lett.6(1) (1977), 1?5) is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a derivation being suitably defined. This problem also subsumes the problem of finding optimal hyperpaths in directed hypergraphs (under varying optimization criteria) that has received attention recently. In this paper we present an incremental algorithm for a version of the grammar problem. As a special case of this algorithm we obtain an efficient incremental algorithm for the single-source shortest-path problem with positive edge lengths. The aspect of our work that distinguishes it from other work on the dynamic shortest-path problem is its ability to handle “multiple heterogeneous modifications”: between updates, the input graph is allowed to be restructured by an arbitrary mixture of edge insertions, edge deletions, and edge-length changes.

[1]  Bowen Alpern,et al.  Incremental evaluation of computational circuits , 1990, SODA '90.

[2]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[3]  Hans Rohnert,et al.  A Dynamization of the All Pairs Least Cost Path Problem , 1985, STACS.

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

[5]  Grant Cheston,et al.  Graph Property Update Algorithms and Their Appligation to Distance Matrices , 1982 .

[6]  Robert E. Tarjan,et al.  Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation , 1988, CACM.

[7]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[8]  Giorgio Ausiello,et al.  Dynamic Maintenance of Directed Hypergraphs , 1990, Theor. Comput. Sci..

[9]  Alan K. Halder.  The Method of Competing Links , 1970 .

[10]  Chih-Chung Lin,et al.  On the dynamic shortest path problem , 1991 .

[11]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.

[12]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[13]  Chee-Keng Yap.  A Hybrid Algorithm for the Shortest Path Between Two Nodes in the Presence of Few Negative Arcs , 1983, Inf. Process. Lett..

[14]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[15]  Thomas W. Reps,et al.  Generating Language-Based Environments , 1982 .

[16]  Donald E. Knuth,et al.  A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..

[17]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[18]  Michael L. Fredman,et al.  Trans-dichotomous algorithms for minimum spanning trees and shortest paths , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  G. Italiano,et al.  Optimal Traversal of Directed Hypergraphs , 1992 .

[20]  John David Murchland,et al.  A fixed matrix method for all shortest distances in a directed graph and for the inverse problem , 1970 .

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

[22]  G. Ramalingam.  Bounded Incremental Computation , 1996, Lecture Notes in Computer Science.

[23]  René Dionne.  Etude Et Extension D’Un Algorithme De Murghland , 1978 .

[24]  Grant Arthur Cheston.  Incremental algorithms in graph theory. , 1976 .

[25]  Peter S Loubai.  A NETWORK EVALUATION PROCEDURE , 1967 .

[26]  Giuseppe F. Italiano,et al.  Online Maintenance of Minimal Directed Hypergraphs , 1989 .

[27]  Alberto L. Sangiovanni-Vincentelli,et al.  A new shortest path updating algorithm , 1978, Networks.

[28]  V. V. Rodionov.  The parametric problem of shortest distances , 1968 .

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

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

[31]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[32]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.