Login / Signup
Correction to: Using the minimum maximum flow degree to approximate the flow coloring problem.
Manoel B. Campêlo
Jhonata A. S. Matias
Published in:
Ann. Oper. Res. (2022)
Keyphrases
</>
maximum flow
minimum cut
flow network
directed graph
graph cuts
push relabel
directed networks
computer vision
shortest path
graph partitioning
min cut max flow