Skip to content

A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs.

Norie Fu

VenueBISAAC
Year2012
ProceedingsISAAC

Browse the full ISAAC paper archive.