Labeled shortest paths in digraphs with negative and positive edge weights
Phillip G. Bradford1 and David A. Thomas2
Department of Computer Science, The University of Alabama, Box 870290,
Tuscaloosa, AL 35487-0290, USA; firstname.lastname@example.org
2 Mercer University, Department of Computer Science, 1400 Coleman Ave, Macon, GA 31207, USA; David.A.Thomas@student.Mercer.edu
Accepted: 6 January 2009
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.
Mathematics Subject Classification: 68Q25 / 52B05 / 68Q42 / 05C78
Key words: Shortest paths / negative and positive edge weights / context free grammars.
© EDP Sciences, 2009