Search
Now showing items 1-1 of 1
Polyhedral combinatorics, complexity and algorithms for k-clubs in graphs
(2012-07)
A k-club is a distance-based graph-theoretic generalization of clique, originally introduced to model cohesive subgroups in social network analysis. The k-clubs represent low diameter clusters in graphs and are suitable ...