Login / Signup

I/O-Efficient Path Traversal in Succinct Planar Graphs.

Craig DillabaughMeng HeAnil MaheshwariNorbert Zeh
Published in: Algorithmica (2017)
Keyphrases
  • planar graphs
  • minimum weight
  • shortest path
  • data structure
  • tree structure
  • directed graph