Processing may take a few seconds...

Chapter


Title

Successive Shortest Path Algorithm for Flows in Dynamic Graphs

Authors

[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2018

Chapter type

chapter in monograph / paper

Publication language

english

Keywords
EN
  • dynamic graphs
  • minimum cost flow
  • successive shortest path algorithm
Pages (from - to)

51 - 54

URL

http://ctw18.lipn.univ-paris13.fr/CTW18_Proceedings.pdf

Book

16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization CNAM, Paris, France, June 18-20, 2018 : Proceedings of the Workshop

Presented on

16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CNAM 2018), 18-20.06.2018, Paris, France

Points of MNiSW / chapter

5.0

Points of MNiSW / conference (CORE)

20.0