Showing cs.DSShow all
3 papers · 1 filter
cs.DS2024
An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum -Bundle Problem
Jinghui Xue, Jiongzhi Zheng, Mingming Jin +1
The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at le…
cs.DS2023
KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
Mingming Jin, Jiongzhi Zheng, Kun He
The Maximum k-Defective Clique Problem (MDCP) aims to find a maximum k-defective clique in a given graph, where a k-defective clique is a relaxation clique missing at most k edges.…
cs.DS2023
Two New Upper Bounds for the Maximum k-plex Problem
Jiongzhi Zheng, Mingming Jin, Kun He
A k-plex in a graph is a vertex set where each vertex is non-adjacent to at most k vertices (including itself) in this set, and the Maximum k-plex Problem (MKP) is to find the larg…