Showing math.OCShow all
3 papers · 1 filter
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.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…
math.OC2024
A simple inverse power method for balanced graph cut
Sihong Shao, Chuan Yang
The existing inverse power () method for solving the balanced graph cut lacks local convergence and its inner subproblem requires a nonsmooth convex solver. To address…