Given an undirected graph G = (V,E), an s-club is a vertex subset S ⊆ V (G) such that G[S] has diameter at most s. Formally, an s-Club problem asks if the input graph has an s-club with at least k vertices. There have been ...