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)
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
Ministry points / chapter
5
Ministry points / conference (CORE)
20
System created by Poznań University of Technology
and Poznan Supercomputing and Networking Center
Log in through eKonto to add to SIS