A strongly polynomial algorithm for the minimum maximum flow degree problem.

Manoel B. Campêlo Jhonata A. S. Matias

Published in: Oper. Res. Lett. (2023)

Keyphrases

maximum flow
minimum cut
directed graph
min cut max flow
directed networks
push relabel
flow network
graph cuts
minimum cost
image understanding
weighted graph