Premium
Dynamic network flows with arc changes
Author(s) -
Minieka E.
Publication year - 1974
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230040305
Subject(s) - arc (geometry) , computer science , maximum flow problem , dynamic network analysis , flow network , flow (mathematics) , mathematical optimization , algorithm , mathematics , computer network , geometry
This paper modifies Ford and Fulkerson's Maximum Dynamic Flow Algorithm so that additional arcs can be added to or deleted from the network at a later time period.