1 paper
Ashwin Jacob, Diptapriyo Majumdar, Raghav Sakhuja
Given an undirected graph G = (V, E) and an integer k, the s-Club asks if Gcontains a vertex subset S of at least k vertices such that G[S] has diameter at most s. Recently, Vertex…