Login / Signup

A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs.

Philip N. KleinSairam Subramanian
Published in: WADS (1993)
Keyphrases
  • planar graphs
  • shortest path
  • polynomial time approximation
  • graphical models