230 citations · 376 across the 34 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
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★ 1 cited
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…