Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract) (0)

Cached

Download Links

by Daniele Frigioni , Alberto Marchetti-spaccamela , Umberto Nanni
Venue:In ACM-SIAM Symposium on Discrete Algorithms
Citations:24 - 4 self

Active Bibliography

19 Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem – Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone - 1997
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
21 Fast replanning for navigation in unknown terrain – Sven Koenig, Senior Member, Maxim Likhachev
28 Lifelong Planning A* – Sven Koenig , Maxim Likhachev , David Furcy - 2005
8 Incremental heuristic search in artificial intelligence – Sven Koenig, Maxim Likhachev, Yaxin Liu, David Furcy
15 Improved Algorithms for Dynamic Shortest Paths – Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis - 1996
© 2000 Springer-Verlag New York Inc. Improved Algorithms for Dynamic Shortest Paths 1 РH. N. Djidjev, G. E. Pantziou, C. D. Zaroliagis
73 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
18 Fully Dynamic Shortest Paths and Negative Cycle Detection on Digraphs with Arbitrary Arc Weights – Daniele Frigioni, Alberto Marchetti-spaccamela, Umberto Nanni - 1998
2 Geometric Shortest Path Containers – Dorothea Wagner, Thomas Willhalm, Christos Zaroliagis - 2004
7 Dynamic Shortest Paths Containers – Dorothea Wagner, Thomas Willhalm, Christos Zaroliagis - 2003
17 Anytime Search in Dynamic Graphs – Maxim Likhachev, Dave Ferguson, Geoff Gordon, Anthony Stentz, Sebastian Thrun
www.elsevier.com/locate/entcs Dynamic Shortest Paths Containers РDorothea Wagner A, Thomas Willhalm A, Christos Zaroliagis B, Universität Karlsruhe
13 Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs – Paolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio - 1996
12 Dynamic Graph Algorithms – Joan Feigenbaum, Sampath Kannan - 2000
A New Approach to Dynamic All Pairs . . . – Camil Demetrescu, Giuseppe F. Italiano - 2003
3 Algorithmic techniques for maintaining shortest routes in dynamic networks – Camil Demetrescu
7 Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano
9 Dynamic shortest paths and transitive closure: algorithmic techniques and data structures – Camil Demetrescu - 2006