3 papers
cs.DS2026
Exact Clique Number Manipulation via Edge Interdiction
Yi Zhou, Haoyu Jiang, Chenghao Zhu +1
The Edge Interdiction Clique Problem (EICP) aims to remove at most edges from a graph so as to minimize the size of the largest clique in the remaining graph. This problem capt…
cs.DS2025
A Near-Real-Time Reduction-Based Algorithm for Coloring Massive Graphs
Chenghao Zhu, Yi Zhou
The graph coloring problem is a classical combinatorial optimization problem with important applications such as register allocation and task scheduling, and it has been extensivel…
cs.DS2025
A Reduction-based Algorithm for the Clique Interdiction Problem
Chenghao Zhu, Yi Zhou, Haoyu Jiang
The Clique Interdiction Problem (CIP) aims to minimize the size of the largest clique in a given graph by removing a given number of vertices. The CIP models a special Stackelberg…