Sequential and distributed algorithmic frameworks for the maximum concurrent flow problem
Networks are everywhere, changing the way we communicate with each other, transport goods and share information. The problems of efficient operation of such networks can often be stated as (abstract) network flow problems. In a problem of this type we want to send some commodity (goods, messages, da...
Main Author: | |
---|---|
Other Authors: | |
Published: |
King's College London (University of London)
2016
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.689179 |