Successive Shortest Path Algorithm for Flows in Dynamic Graphs

Mathilde Vernet (1) , Maciej Drozdowski (2) , Yoann Pigné (1) , Eric Sanlaville (1)

1 RI2C - LITIS - Equipe Réseaux d'interactions et Intelligence Collective
2 Institute of Computing Science [Poznan]

This work focuses on the minimum cost flow problem in dynamic graphs. We use a model in which there are no travel time on arcs, and storage on vertices is not allowed. Every other graph parameter is time-dependent. We propose a method using the successive shortest path algorithm that avoids using the time-expanded graph that significantly increases the complexity of the problem. Our method is implemented using the GraphStream library.

Mots clés: dynamic graphs; minimum cost flow; successive shortest path algorithm

Domaines: Informatique [cs]; Recherche opérationnelle [math.OC]

Mathilde Vernet, Maciej Drozdowski, Yoann Pigné, Eric Sanlaville. Successive Shortest Path Algorithm for Flows in Dynamic Graphs. Cologne Twente Workshop, Jun 2018, Paris, France. ⟨hal-02115408⟩