Abstract
A set-pair Lovasz extension is established to construct equivalent continuous optimization problems for graph k-cut problems.
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
