A Faster Branching Algorithm for the Maximum $k$-Defective Clique Problem

Open in new window