Efficient Branch-and-Bound Algorithms for Finding Triangle-Constrained 2-Clubs

Niels Grüttemeier, Philipp Heinrich Keßler, Christian Komusiewicz +1

In the Vertex Triangle 2-Club problem, we are given an undirected graph $G$ and aim to find a maximum-vertex subgraph of $G$ that has diameter at most 2 and in which every vertex i…