当前位置:
X-MOL 学术
›
Commun. Math. Sci.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Lovász extension and graph cut
Communications in Mathematical Sciences ( IF 1.2 ) Pub Date : 2021-01-01 , DOI: 10.4310/cms.2021.v19.n3.a9 Kung-Ching Chang 1 , Sihong Shao 2 , Dong Zhang 2 , Weixi Zhang 2
Communications in Mathematical Sciences ( IF 1.2 ) Pub Date : 2021-01-01 , DOI: 10.4310/cms.2021.v19.n3.a9 Kung-Ching Chang 1 , Sihong Shao 2 , Dong Zhang 2 , Weixi Zhang 2
Affiliation
A set-pair Lovász extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
中文翻译:
Lovász扩展和图形切割
建立了对对Lovász扩展,以构造图$ k $ -cut问题的等效连续优化问题。
更新日期:2021-01-01
中文翻译:
Lovász扩展和图形切割
建立了对对Lovász扩展,以构造图$ k $ -cut问题的等效连续优化问题。