Login / Signup

An efficient oracle for counting shortest paths in planar graphs.

Ye GongQian-Ping Gu
Published in: Theor. Comput. Sci. (2022)
Keyphrases
  • shortest path
  • planar graphs
  • weighted graph
  • shortest path algorithm
  • road network
  • geodesic distance
  • finding the shortest path
  • minimum weight
  • travel time
  • image segmentation