Lov\'asz extension and graph cut
Abstract
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph k-cut problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.