Premium
Minimum flows in (s, t ) planar networks
Author(s) -
Adlakha V.,
Gladysz B.,
Kamburowski J.
Publication year - 1991
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.3230210705
Subject(s) - arc (geometry) , planar , bounded function , flow (mathematics) , minimum cost flow problem , flow network , multi commodity flow problem , maximum flow problem , mathematics , planar graph , combinatorics , computer science , mathematical optimization , geometry , graph , mathematical analysis , computer graphics (images)
The minimum flow problem in a network is to find a flow with the smallest value so that the flow on each arc is bounded from below by the arc capacity. We present a linear time algorithm for solving the problem in (s,t) planar directed networks.
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