The maximum flows in bipartite dynamic networks with lower bounds. The static approach

Autor:	Camelia Schiopu, Eleonor Ciurea
Rok vydání:	2016
Předmět:	Theoretical computer science Computer science Maximum flow problem 3-dimensional matching Bipartite graph Flow network Topology Upper and lower bounds MathematicsofComputing_DISCRETEMATHEMATICS
Zdroj:	2016 6th International Conference on Computers Communications and Control (ICCCC).
DOI:	10.1109/icccc.2016.7496731
Popis:	In this paper we study maximum flow algorithms for bipartite dynamic networks with lower bounds. We resolve this problem by rephrasing into a problem in bipartite static network. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. In the final of the paper we present an example.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::f555d2eba4111fdc232a75d2fea1520a https://doi.org/10.1109/icccc.2016.7496731 Zobrazit plný text záznamu