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

DOI10.1007/978-3-642-35261-4_42zbMath1260.68447OpenAlexW946369786MaRDI QIDQ4909556

Norie Fu

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_42

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Nonnumerical algorithms (68W05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On rotational symmetries of drawings of coherent periodic graphs ⋮ An algebraic algorithm for solving parametric integer programs