A Dynamization of the All Pairs Least Cost Path Problem

Authors:
Hans Rohnert
Affiliations:
-
Venue:
STACS '85 Proceedings of the 2nd Symposium of Theoretical Aspects of Computer Science
Year:
1985

Citing 0
Cited 3

Experimental analysis of dynamic algorithms for the single source shortest paths problem

Journal of Experimental Algorithmics (JEA)
A new approach to dynamic all pairs shortest paths

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Implementations and experimental studies of dynamic graph algorithms

Experimental algorithmics

Quantified Score

Hi-index	0.00

Visualization

Abstract