3 papers
cs.IR2025
A Reduction-Driven Local Search for the Generalized Independent Set Problem
Yiping Liu, Yi Zhou, Zhenxiang Xu +2
The Generalized Independent Set (GIS) problem extends the classical maximum independent set problem by incorporating profits for vertices and penalties for edges. This generalized…
cs.DS2024
A Faster Branching Algorithm for the Maximum -Defective Clique Problem
Chunyu Luo, Yi Zhou, Zhengren Wang +1
A -defective clique of an undirected graph is a subset of its vertices that induces a nearly complete graph with a maximum of missing edges. The maximum -defective cl…
cs.DS2023
Fast Maximum -Plex Algorithms Parameterized by Small Degeneracy Gaps
Zhengren Wang, Yi Zhou, Chunyu Luo +2
Given a graph, a -plex is a set of vertices in which each vertex is not adjacent to at most other vertices in the set. The maximum -plex problem, which asks for the lar…