Dynamic algorithms for shortest paths in planar graphs
type: Item
instance of: scholarly article
title: Dynamic algorithms for shortest paths in planar graphs
zbMATH Open document ID: 0783.68092
DOI: 10.1016/0304-3975(93)90328-Q
author: E. Feuerstein
author: Alberto Marchetti-Spaccamela
published in: Theoretical Computer Science
publication date: 1993-10-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 417324
zbMATH Keywords: maintaining shortest paths
zbMATH Keywords: maintaining the maximum flow
zbMATH Keywords: planar network
MaRDI profile type: MaRDI publication profile
cites work: Incremental algorithms for minimal length paths
cites work: Incremental convex planarity testing
cites work: Q4038721
cites work: A note on two problems in connexion with graphs
cites work: Improved algorithms for dynamic shortest paths
cites work: Q3138871
cites work: Q3679232
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Parallel concepts in graph theory
cites work: A Separator Theorem for Planar Graphs
cites work: Q4739657
cites work: Q3685214
full work available at URL: 0304-3975(93)90328-q
OpenAlex ID: W1967389135
Recommended article: Q4694731
Recommended article: Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Recommended article: On-line and dynamic algorithms for shortest path problems
Recommended article: A fully dynamic approximation scheme for shortest paths in planar graphs
Recommended article: Improved algorithms for dynamic shortest paths
description: scientific article; zbMATH DE number 417324