Open AccessTwo Flow Problems in Dynamic Networks
Author(s) -
Camelia Șchiopu,
Eleonor Ciurea
Publication year - 2016
Publication title -
international journal of computers communications and control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.422
H-Index - 33
eISSN - 1841-9844
pISSN - 1841-9836
DOI - 10.15837/ijccc.2017.1.2786
Subject(s) - bipartite graph , maximum flow problem , flow (mathematics) , flow network , computer science , multi commodity flow problem , dynamic network analysis , minimum cost flow problem , dynamic problem , mathematical optimization , upper and lower bounds , mathematics , theoretical computer science , algorithm , computer network , mathematical analysis , geometry , graph
In this paper we study two flow problems: the feasible flow problem in dynamic networks and the maximum flow problem in bipartite dynamic networks with lower bounds. We mention that the maximum flow problem in bipartite dynamic networks with lower bound was presented in paper [8]a. For these problems we give examples.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom