An Incremental Algorithm for a Generalization of the Shortest-Path Problem (1992)

by G. Ramalingam , Thomas Reps
Citations:116 - 1 self

Active Bibliography

52 On the Computational Complexity of Dynamic Graph Problems – G. Ramalingam, Thomas Reps - 1996
15 Improved Algorithms for Dynamic Shortest Paths – Hristo N. Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis - 1996
5 Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms – Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni - 1998
19 Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem – Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone - 1997
21 Optimal Traversal of Directed Hypergraphs – Giorgio Ausiello, Roberto Giaccio, Giuseppe F. Italiano, Umberto Nanni - 1992
8 Incremental heuristic search in artificial intelligence – Sven Koenig, Maxim Likhachev, Yaxin Liu, David Furcy
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
11 Dynamic Expression Trees – Robert F. Cohen, Roberto Tamassia - 1991
35 Fully Dynamic All Pairs Shortest Paths with Real Edge Weights – Camil Demetrescu, Giuseppe F. Italiano - 2001
73 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
2 Geometric Shortest Path Containers – Dorothea Wagner, Thomas Willhalm, Christos Zaroliagis - 2004
© 2000 Springer-Verlag New York Inc. Improved Algorithms for Dynamic Shortest Paths 1 – H. N. Djidjev, G. E. Pantziou, C. D. Zaroliagis
3 Algorithmic techniques for maintaining shortest routes in dynamic networks – Camil Demetrescu
9 Dynamic shortest paths and transitive closure: algorithmic techniques and data structures – Camil Demetrescu - 2006
The Thinnest Path Problem for Secure Communications: A Directed Hypergraph Approach – Jianhang Gao, Qing Zhao, Ananthram Swami
Dynamic Shortest Path . . . – J. Gao, Q. Zhao, W. Ren, A. Swami, R. Ramanathan, A. Bar-noy
3 Linear Connectivity Problems in Directed Hypergraphs – Mayur Thakur, Rahul Tripathi
Incremental Social Centrality Algorithms for Dynamic Networks – Miray Kas, Miray Kas