An exact algorithm for the maximum k-club problem in an undirected graph.
Jean-Marie BourjollyGilbert LaporteGilles PesantPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- undirected graph
- spanning tree
- directed graph
- approximation algorithms
- directed acyclic graph
- minimum cost
- connected components
- positive integer
- complex networks
- shortest path problem
- exact algorithms
- integer programming
- random graphs
- graph structure
- disjoint paths
- strongly connected
- computer vision
- branch and bound algorithm
- graphical models
- adjacency matrix
- planar graphs
- lower bound
- computational complexity
- objective function