Finding Real-Valued Single-Source Shortest Paths ino(n3) Expected Time
Work
Year: 1998
Type: article
Abstract: Given ann-vertex,m-edge directed networkGwith real costs on the edges and a designated source vertexs, we give a new algorithm to compute shortest paths froms. Our algorithm is a simple deterministic ... more
Source: Journal of Algorithms
Institution Dartmouth College
Cites: 31
Cited by: 15
Related to: 10
FWCI: 1.748
Citation percentile (by year/subfield): 71.94
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid