<?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></authors></contributors><titles><title><style face="normal" font="default" size="100%">   Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs</style></title><secondary-title><style face="normal" font="default" size="100%">SCIENCE CHINA Mathematics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://link.springer.com/article/10.1007/s11425-017-9096-6</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">60</style></volume><pages><style face="normal" font="default" size="100%">1963-1980</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This is primarily an expository paper surveying up-to-date known results on the spectral theory of 1-Laplacian on graphs and its applications to the Cheeger cut, maxcut and multi-cut problems. The structure of eigenspace, nodal domains, multiplicities of eigenvalues, and algorithms for graph cuts are collected.</style></abstract><issue><style face="normal" font="default" size="100%">11</style></issue></record></records></xml>