most citedExact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments

11 citations · 11 across the 1 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2018★ 11 cited

Exact Algorithms for Finding Well-Connected 2-Clubs in Real-World Graphs: Theory and Experiments

Christian Komusiewicz, André Nichterlein, Rolf Niedermeier +1

Finding large "cliquish" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter…