3 papers
math.OC2026
A Parallel Evolutionary Algorithm Framework for Graph -CUT Problems
Sihong Shao, Chuan Yang
Graph k-CUT problems include many important variants whose objectives combine cut value, volume, and cardinality terms in different ways. Most existing algorithms are designed for…
math.CO2026
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.OC2025
Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
Sihong Shao, Chuan Yang, Xinyang Ye
Conventional spectral digraph partitioning methods typically symmetrize the adjacency matrix, thereby transforming the directed graph partitioning problem into an undirected one, w…