An exact algorithm for the maximum \(k\)-club problem in an undirected graph
type: Item
instance of: scholarly article
title: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
zbMATH Open document ID: 1008.90048
DOI: 10.1016/S0377-2217(01)00133-3
author: Jean-Marie Bourjolly
author: G. Laporte
author: Gilles Pesant
published in: European Journal of Operational Research
publication date: 2002-06-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 1756523
zbMATH Keywords: maximum \(k\)-club problem
zbMATH Keywords: branch-and-bound algorithm
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
cites work: A graph‐theoretic definition of a sociometric clique†
cites work: Three‐dimensional blockmodels
cites work: Heuristics for finding \(k\)-clubs in an undirected graph
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: Q4198056
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Q4714131
cites work: Q3685214
description: scientific article; zbMATH DE number 1756523