Heuristics for finding \(k\)-clubs in an undirected graph
type: Item
instance of: scholarly article
title: Heuristics for finding \(k\)-clubs in an undirected graph
zbMATH Open document ID: 0955.91051
DOI: 10.1016/S0305-0548(99)00047-7
author: Jean-Marie Bourjolly
author: G. Laporte
author: Gilles Pesant
published in: Computers \& Operations Research
publication date: 2001-03-04T00:00:00Z
Mathematics Subject Classification ID: 91D30
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 1448734
zbMATH Keywords: undirected graph
zbMATH Keywords: \(k\)-clubs
zbMATH Keywords: \(k\)-cliques
zbMATH Keywords: heuristics
describes a project that uses: Algorithm 457
MaRDI profile type: Publication
cites work: Three‐dimensional blockmodels
cites work: On the connectivity of social networks†
cites work: A formal theory of social power
cites work: Some genuine graph models in anthropology
cites work: Q4397004
cites work: Algorithm 457: finding all cliques of an undirected graph
cites work: A graph‐theoretic definition of a sociometric clique†
cites work: Reducibility among Combinatorial Problems
cites work: Q3685214
cites work: Solving the maximum clique problem using a tabu search approach
full work available at URL: s0305-0548(99)00047-7
OpenAlex ID: W2136955214
Recommended article: Finding large \(k\)-clubs in undirected graphs
Recommended article: Two-phase heuristics for the \(k\)-club problem
Recommended article: An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Recommended article: Algorithms for the maximum \(k\)-club problem in graphs
Recommended article: Finding Disjoint Dense Clubs in an Undirected Graph
Recommended article: Finding clubs in graph classes
Recommended article: Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
Recommended article: Upper bounds and heuristics for the 2-club problem
Recommended article: Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Recommended article: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
description: scientific article; zbMATH DE number 1448734