Labeled shortest paths in digraphs with negative and positive edge weights

This paper gives a shortest path algorithm for CFG (context free grammar) labeled and weighted digraphs where edge weights may be positive or negative, but negative-weight cycles are not allowed in the underlying unlabeled graph. These results build directly on an algorithm of Barrett et al.  [SIAM J. Comput. 30 (2000) 809–837]. In addition to many other results, they gave a shortest path algorithm for CFG labeled and weighted digraphs where all edges are nonnegative. Our algorithm is based closely on Barrett et al. 's algorithm as well as Johnson's algorithm for shortest paths in digraphs whose edges may have positive or negative weights.

[1]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[2]  Alberto O. Mendelzon,et al.  Finding Regular Simple Paths in Graph Databases , 1989, SIAM J. Comput..

[3]  Uri Zwick,et al.  Exact and Approximate Distances in Graphs - A Survey , 2001, ESA.

[4]  Madhav V. Marathe,et al.  Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router , 2002, ESA.

[5]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[6]  H. James Hoover,et al.  Limits to Parallel Computation: P-Completeness Theory , 1995 .

[7]  T. Roman,et al.  Limits To Parallel Computation: P-Completeness Theory [Book Review] , 1999, IEEE Concurrency.

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

[9]  C. Barrett,et al.  Label Constrained Shortest Path Algorithms : An Experimental Evaluation using Transportation Networks , 2007 .

[10]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[11]  Matti Nykänen,et al.  The Exact Path Length Problem , 2002, J. Algorithms.

[12]  Madhav V. Marathe,et al.  Formal-Language-Constrained Path Problems , 1997, SIAM J. Comput..

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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