Title of article
Heuristics for finding k-clubs in an undirected graph
Author/Authors
Jean-Marie Bourjolly، نويسنده , , Gilbert Laporte، نويسنده , , Gilles Pesant، نويسنده ,
Issue Information
دوهفته نامه با شماره پیاپی سال 2000
Pages
11
From page
559
To page
569
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.
Keywords
k-cliques , Heuristics , k-clubs
Journal title
Computers and Operations Research
Serial Year
2000
Journal title
Computers and Operations Research
Record number
927093
Link To Document