This paper proposes an algorithm to solve multi - intersection coordinated control problem, which combines the maximal flow theory with the game theory and considers both the individual interests of ...

Methods: Our algorithm performs multiple binary segmentations of the TCD spectrogram and then extracts the pertaining envelopes (maximal flow velocity waveforms) via an edge-following step that ...

Abstract Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve ...

Cherkasky, B.V. (1977) An Algorithm for Constructing Maximal Flows in Networks with Complexity of Operations. Mathematical Methods of Solution of Economical Problems, 7, 117-125.

In the "classical" network flow model, flows are constrained by the capacities of individual arcs. In the "polymatroidal" network flow model introduced in this paper, flows are constrained by the ...