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.
@article{ITA_2009__43_3_567_0,
author = {Bradford, Phillip G. and Thomas, David A.},
title = {Labeled shortest paths in digraphs with negative and positive edge weights},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
volume = {43},
year = {2009},
pages = {567-583},
doi = {10.1051/ita/2009011},
mrnumber = {2541131},
zbl = {1175.68196},
language = {en},
url = {http://dml.mathdoc.fr/item/ITA_2009__43_3_567_0}
}
Bradford, Phillip G.; Thomas, David A. Labeled shortest paths in digraphs with negative and positive edge weights. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 43 (2009) pp. 567-583. doi : 10.1051/ita/2009011. http://gdmltest.u-ga.fr/item/ITA_2009__43_3_567_0/
[1] , and , Formal-language-constrained path problems. SIAM J. Comput. 30 (2000) 809-837. | MR 1778288 | Zbl 0968.68066
[2] , , , , and , Label Constrained Shortest Path Algorithms: An Experimental Evaluation using Transportation Networks. Tech. Report: Virginia Tech (USA), Arizona State University (USA), and Karlsruhe University (Germany), Presented at at the workshop on the DIMACS Shortest-Path Challenge, http://i11www.ira.uka.de/algo/people/mholzer/publications/pdf/bbhkmw-lcspa-07.pdf
[3] , , , and , Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSMIS router. European Symposium on Algorithms (ESA 02). Lect. Notes Comput. Sci. 2461 (2002) 126-138. | Zbl 1019.68801
[4] and , Fast Dyck and semi-Dyck constrained shortest paths on DAGs (submitted).
[5] and , Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9 (1990) 251-280. | MR 1056627 | Zbl 0702.65046
[6] , , and , Introduction to Algorithms, 2nd edition. MIT Press (2001). | MR 1848805 | Zbl 1047.68161
[7] , and , Limits to Parallel Computation: P-Completeness Theory. Oxford University Press (1995). | MR 1333600 | Zbl 0829.68068
[8] and , Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979). | MR 645539 | Zbl 0426.68001
[9] , Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1) (1977) 1-13. | MR 449710 | Zbl 0343.68028
[10] and , Finding regular simple paths in graph databases. SIAM J. Comput. 24 (1995) 1235-1258. | MR 1361155 | Zbl 0845.68033
[11] and , The exact path length problem. J. Algor. 42 (2002) 41-53. | MR 1874635 | Zbl 1057.90049
[12] , Complete pushdown languages. Unpublished manuscript (1979).
[13] , Graph-theoretic methods in database theory. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '90). ACM, New York, NY (1990) 230-242.
[14] , Exact and Approximate Distances in Graphs - A survey. In Proceedings of the Ninth ESA (2001) 33-48. | MR 1913540 | Zbl 1006.68543