6 citations · 6 across the 1 of their papers we have counts for
1 paper
Doron Goldstein, Michael Langberg
Given a graph G = (V,E) and a parameter k, we consider the problem of finding a subset U in V of size k that maximizes the number of induced edges (DkS). We improve upon the previo…