Kavli Affiliate: Yi Zhou | First 5 Authors: Chunyu Luo, Yi Zhou, Zhengren Wang, Mingyu Xiao, | Summary: A $k$-defective clique of an undirected graph $G$ is a subset of its vertices that induces a nearly complete graph with a maximum of $k$ missing edges. The maximum $k$-defective clique problem, which asks for the largest […]
Continue.. A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem