Login / Signup

Developing a tetramonohedron with minimum cut length.

Erik D. DemaineMartin L. DemaineRyuhei Uehara
Published in: Comput. Geom. (2023)
Keyphrases
  • minimum cut
  • maximum flow
  • graph cuts
  • weighted graph
  • shortest path problem
  • graph partitioning
  • directed graph
  • computer vision
  • normalized cut
  • min cut max flow