Login / Signup

Dynamic Algorithms for Shortest Paths in Planar Graphs.

Esteban FeuersteinAlberto Marchetti-Spaccamela
Published in: WG (1991)
Keyphrases
  • shortest path
  • planar graphs
  • shortest path algorithm
  • minimum cost flow
  • special case
  • np hard
  • optimization problems
  • markov random field
  • strongly connected components