Hervé BRICARD – Optimization Group - IT department
An adaptation of Eppstein’s algorithm building, for a given directed graph, the K shortest circuitless paths having at most P arcs between a source node and a target node. Hervé BRICARD – Optimization Group - IT department. 2007, January 26th, Bordeaux LABRI. Agenda.
506 views • 41 slides