Cheeger's cut, maxcut and the spectral theory of1-Laplacian on graphs

被引:0
|
作者
CHANG KungChing [1 ]
SHAO SiHong [1 ]
ZHANG Dong [1 ]
机构
[1] LMAM and School of Mathematical Sciences, Peking University
基金
中国国家自然科学基金;
关键词
spectral graph theory; Laplacian; graph cut; optimization; critical point theory;
D O I
暂无
中图分类号
O157.5 [图论];
学科分类号
070104 ;
摘要
This is primarily an expository paper surveying up-to-date known results on the spectral theory of1-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.
引用
收藏
页码:1963 / 1980
页数:18
相关论文
共 30 条