<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Kung-Ching Chang</style></author><author><style face="normal" font="default" size="100%">Sihong Shao</style></author><author><style face="normal" font="default" size="100%">Dong Zhang</style></author><author><style face="normal" font="default" size="100%">Weixi Zhang</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Lovász extension and graph cut</style></title><secondary-title><style face="normal" font="default" size="100%">Communications in Mathematical Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://dx.doi.org/10.4310/CMS.2021.v19.n3.a9</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">761–786</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">A set-pair Lovász extension is established to construct equivalent continuous optimization problems for graph &lt;em&gt;k&lt;/em&gt;-cut problems.</style></abstract><issue><style face="normal" font="default" size="100%">3</style></issue></record></records></xml>