Heuristics for finding k-clubs in an undirected graph

0.00 Avg rating—0 Votes

Article ID:	iaor2001941
Country:	United Kingdom
Volume:	27
Issue:	6
Start Page Number:	559
End Page Number:	569
Publication Date:	May 2000
Journal:	Computers and Operations Research
Authors:	Laporte Gilbert, Bourjolly Jean-Marie, Pesant Gilles
Keywords:	heuristics

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.

Reviews

Required fields are marked *. Your email address will not be published.