scholarly journals Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids

2016 ◽  
Vol 30 (3) ◽  
pp. 1775-1797
Author(s):  
Bertrand Guenin ◽  
Leanne Stuive
Keyword(s):  
Commodity Flow ◽  
Single Commodity

scholarly journals Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1716
Author(s):  
Adrian Marius Deaconu ◽  
Delia Spridon
Keyword(s):  
Network Flow ◽  
Large Scale ◽  
Random Network ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Network Flow Problems ◽  
Commodity Flow ◽  
Vast Number ◽  
Flow Problems ◽  
Execution Speed

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-commodity flow problems, are continuously developed and improved, and so, random network generators become indispensable to simulate the functionality and to test the correctness and the execution speed of these algorithms. For this purpose, in this paper, the well-known Erdős–Rényi model is adapted to generate random flow (transportation) networks. The developed algorithm is fast and based on the natural property of the flow that can be decomposed into directed elementary s-t paths and cycles. So, the proposed algorithm can be used to quickly build a vast number of networks as well as large-scale networks especially designed for s-t flows.

scholarly journals A Multi-Commodity Flow Problem for Fair Resource Allocation in Multi-Path Video Delivery Networks

2020 ◽  
Vol 53 (2) ◽  
pp. 7386-7391
Author(s):  
Luca De Cicco ◽  
Gioacchino Manfredi ◽  
Vittorio Palmisano ◽  
Saverio Mascolo
Keyword(s):  
Resource Allocation ◽  
Flow Problem ◽  
Video Delivery ◽  
Commodity Flow ◽  
Delivery Networks
Sign in / Sign up

Export Citation Format

Share Document