2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.OC2026
Constant-Modulus Optimization for Quadratic K-Medoids Graph Clustering
Yutong Zheng, Qingna Li, Wenshun Teng
Graph clustering aims to partition the vertices of a graph into groups with dense intra-cluster connections and sparse inter-cluster connections. In this paper, we study a quadrati…
math.OC2025
A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
Wenshun Teng, Qingna Li
Seeking the external equitable partitions (EEPs) of networks under unknown structures is an emerging problem in network analysis. The special structure of EEPs has found widespread…
math.OC2025★ 2 cited
An Efficient Quadratic Penalty Method for a Class of Graph Clustering Problems
Wenshun Teng, Qingna Li
Community-based graph clustering is one of the most popular topics in the analysis of complex social networks. This type of clustering involves grouping vertices that are considere…