ISSN:
1572-9125
Keywords:
shortest path
;
digraph
;
algorithm
;
5.25
;
5.32
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract If each negative length arc of a digraphG is acyclic, i.e., does not belong to any cycle, then we show that the shortest paths from a given node to all other nodes can be computed inO(V 2) time, whereV is the number of nodes inG.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01933647