Maintaining shortest paths in digraphs with arbitraryarc weights: an experimental study (1982)

by C Demetrescu, D Frigioni, A Marchetti-Spaccamela, U Nanni
Venue:In Proceedings of the 4th Workshop on Algorithm Engineering (WAE’00). Springer Lecture Notes in Computer Science