finds a largest k-club in the graph g.


  • A k-club is a maximal set of vertices where the diameter of the corresponding subgraph is at most k.
  • FindKClub returns a list of k-clubs.
  • FindKClub will return an empty list if there is no k-club.
  • FindKClub works with undirected graphs and multigraphs.
Introduced in 2012
| Updated in 2014