Login / Signup

Using the minimum maximum flow degree to approximate the flow coloring problem.

Manoel B. CampêloJhonata A. S. Matias
Published in: Ann. Oper. Res. (2022)
Keyphrases
  • maximum flow
  • minimum cut
  • flow network
  • directed graph
  • push relabel
  • graph cuts
  • min cut max flow
  • computer vision
  • information theoretic
  • shape prior
  • graph partitioning
  • directed networks