Dynamic algorithms for shortest paths in planar graphs (original) (raw)

Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs

Christos Zaroliagis

Lecture Notes in Computer Science, 1995

View PDFchevron_right

Improved Algorithms for Dynamic Shortest Paths

Christos Zaroliagis

Algorithmica, 2000

View PDFchevron_right

Planar Graphs, Negative Weight Edges, Shortest Paths, Near Linear Time

Jittat Fakcharoenphol

2001

View PDFchevron_right

Maximum flows and parametric shortest paths in planar graphs

Jeff Erickson

View PDFchevron_right

Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential Algorithms

Christos Zaroliagis

Algorithmica, 2000

View PDFchevron_right

An external memory data structure for shortest path queries

Anil Maheshwari

Discrete Applied Mathematics, 2003

View PDFchevron_right

On-line and dynamic algorithms for shortest path problems

Christos Zaroliagis

Lecture Notes in Computer Science, 1995

View PDFchevron_right

Shortest path queries in digraphs of small treewidth

Christos Zaroliagis

Lecture Notes in Computer Science, 1995

View PDFchevron_right

Computing All-Pairs Shortest Paths by Leveraging Low Treewidth (extended abstract)

Léon Planken

2011

View PDFchevron_right

Fully dynamic algorithms for maintaining shortest paths trees

Umberto Nanni

Journal of Algorithms, 2000

View PDFchevron_right

Fully dynamic all pairs shortest paths with real edge weights

Camil Demetrescu

2001

View PDFchevron_right

A new algorithm to find the shortest paths between all pairs of nodes

Giorgio Gallo

Discrete Applied Mathematics, 1982

View PDFchevron_right

Fully dynamic shortest paths in digraphs with arbitrary arc weights

Umberto Nanni

Journal of Algorithms, 2003

View PDFchevron_right

A new approach to dynamic all pairs shortest paths

Camil Demetrescu

2004

View PDFchevron_right

Efficient parallel algorithms for shortest paths in planar digraphs

Christos Zaroliagis

BIT, 1992

View PDFchevron_right

Incremental algorithms for minimal length paths

Giorgio Ausiello, Umberto Nanni

Journal of Algorithms, 1991

View PDFchevron_right

Data structures for two-edge connectivity in planar graphs

Subhash Suri

Theoretical Computer Science, 1994

View PDFchevron_right

Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms

Christos Zaroliagis

Theoretical Computer Science, 1998

View PDFchevron_right

Maximum st-Flow in Directed Planar Graphs via Shortest Paths

Anna Harutyunyan

Lecture Notes in Computer Science, 2013

View PDFchevron_right

Computing all-pairs shortest paths by leveraging low treewidth

Mathijs de Weerdt

2012

View PDFchevron_right

Improved bounds and new trade-offs for dynamic all pairs shortest paths

Camil Demetrescu

2002

View PDFchevron_right

Maintaining shortest paths in digraphs with arbitrary arc weights: An experimental study

Umberto Nanni

Algorithm …, 2001

View PDFchevron_right

On-line computation of minimal and maximal length paths

Umberto Nanni

Theoretical Computer …, 1992

View PDFchevron_right