A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs (1993)

by Philip N. Klein , Sairam Subramanian
Citations:17 - 1 self

Active Bibliography

Parallel and Dynamic Shortest-Path Algorithms for Sparse Graphs – Sairam Subramanian, Sairam Subramanian, Philip N. Klein, Roberto Tamassia, Jeffrey S. Vitter - 1995
14 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
161 Faster Shortest-Path Algorithms for Planar Graphs – Philip Klein , Satish Rao, Monika Rauch, Sairam Subramanian - 1994
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
15 Improved Algorithms for Dynamic Shortest Paths – H. N. Djidjev, G. E. Pantziou, C. D. Zaroliagis - 2000
8 Dynamic shortest paths and transitive closure: algorithmic techniques and data structures – Camil Demetrescu - 2006
35 Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms – Shiva Chaudhuri , Christos D. Zaroliagis - 1995
35 Fully Dynamic All Pairs Shortest Paths with Real Edge Weights – Camil Demetrescu, Giuseppe F. Italiano - 2001
5 A Uniform Approach to Semi-Dynamic Problems on Digraphs – Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese - 1998
55 Dynamic Graph Algorithms – David Eppstein, Zvi Galil, Giuseppe F. Italiano - 1999
1 External Data Structures for Shortest Path Queries on Planar Digraphs – Lars Arge, Laura Toma
11 Dynamic Graph Algorithms – Joan Feigenbaum, Sampath Kannan - 2000
2 An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs – Sairam Subramanian, Roberto Tamassia, Jeffrey Scott Vitter - 1993
18 A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs – Jesper L. Träff, Christos D. Zaroliagis - 1996
19 Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem – Daniele Frigioni, Mario Ioffreda, Umberto Nanni, Giulio Pasqualone - 1997
68 A New Approach to Dynamic All Pairs Shortest Paths – Camil Demetrescu, Giuseppe F. Italiano - 2002
Single source shortest paths in H-minor free graphs – Raphael Yuster
7 Multiplesource shortest paths in embedded graphs – Sergio Cabello, Erin W. Chambers, Jeff Erickson - 2012
1 Efficient Parallel Algorithms for Planar st-Graphs 1 – Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu, Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu - 2002