Finding densest k-connected subgraphs | Publicación