Heuristics for finding-clubs in an undirected graph
Abstract: In a graph G, a k-club is a vertex set inducing a subgraph of diameter k. These structures play an important role in several applications arising in social and behavioral sciences. We derive some properties of k-clubs and we propose three heuristics for determining a largest k-club in a graph. Comparative computational results confirm the speed and efficiency of these heuristics.Scope and purposeSocial and behavioral scientists frequently use network analysis to study linkages between groups, individuals or abstract entities. Applications are encountered in psychology, marketing, organization theory, anthropology, economics, sociology, etc. A common problem is to identify dense structures in a graph. This article is about the determination of one such type of structure called k-club. Three efficient heuristics for the determination of k-clubs are developed and compared.
Loading