scientific article; zbMATH DE number 219245
From MaRDI portal
Publication:4694731
zbMath0768.68138MaRDI QIDQ4694731
Esteban Feuerstein, Alberto Marchetti-Spaccamela
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
shortest pathplanar graphsdata structuresmaximum flow problemoff-line algorithmshortest-path treeshortest distances
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (4)
A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs ⋮ Shortest path computations in source-deplanarized graphs ⋮ Shortest-path queries in static networks ⋮ Unnamed Item
This page was built for publication:
