Login / Signup

Non-crossing shortest paths lengths in planar graphs in linear time.

Lorenzo BalzottiPaolo Giulio Franciosa
Published in: Discret. Appl. Math. (2024)
Keyphrases
  • shortest path
  • planar graphs
  • weighted graph
  • minimum length
  • shortest path algorithm
  • minimum weight
  • road network
  • worst case
  • travel time
  • geodesic distance
  • graph partitioning
  • minimum spanning tree
  • image sequences