10 citations · 12 across the 3 of their papers we have counts for
3 papers
math.CO2024
Equivalent spectral theory for fundamental graph cut problems
Sihong Shao, Chuan Yang, Dong Zhang +1
We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem a…
math.OC2018★ 10 cited
A simple iterative algorithm for maxcut
Sihong Shao, Dong Zhang, Weixi Zhang
We propose a simple iterative (SI) algorithm for the maxcut problem through fully using an equivalent continuous formulation. It does not need rounding at all and has advantages th…
math.CO2018★ 2 cited
Lovász extension and graph cut
Kung-Ching Chang, Sihong Shao, Dong Zhang +1
A set-pair Lovász extension is established to construct equivalent continuous optimization problems for graph -cut problems.