Heuristics for finding k-clubs in an undirected graph

Recommendations

Finding large k-clubs in undirected graphs
Two-phase heuristics for the \(k\)-club problem
An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Algorithms for the maximum k-club problem in graphs
Finding Disjoint Dense Clubs in an Undirected Graph
Finding clubs in graph classes
Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs
Upper bounds and heuristics for the 2-club problem
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
On inclusionwise maximal and maximum cardinality k-clubs in graphs

Cites work

A formal theory of social power
A graph‐theoretic definition of a sociometric clique†
Algorithm 457: finding all cliques of an undirected graph
scientific article; zbMATH DE number 3907787 (Why is no real title available?)
scientific article; zbMATH DE number 1168330 (Why is no real title available?)
On the connectivity of social networks†
Reducibility among combinatorial problems
Solving the maximum clique problem using a tabu search approach
Some genuine graph models in anthropology
Three‐dimensional blockmodels

Cited in

(31)

An exact algorithm for the maximum \(k\)-club problem in an undirected graph
Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
Frequency-driven tabu search for the maximum \(s\)-plex problem
On biconnected and fragile subgraphs of low diameter
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
Multivariate algorithmics for finding cohesive subnetworks
Parameterized computational complexity of finding small-diameter subgraphs
An opposition-based memetic algorithm for the maximum quasi-clique problem
Parsimonious formulations for low-diameter clusters
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
Exact algorithms for the minimum \(s\)-club partitioning problem
The triangle \(k\)-club problem
Finding disjoint dense clubs in a social network
Distance-based clique relaxations in networks: s-clique and s-club
On the 2-club polytope of graphs
Two-phase heuristics for the \(k\)-club problem
Algorithms for the maximum k-club problem in graphs
Identifying large robust network clusters via new compact formulations of maximum k-club problems
On inclusionwise maximal and maximum cardinality k-clubs in graphs
Finding Disjoint Dense Clubs in an Undirected Graph
Finding large k-clubs in undirected graphs
On Fault-Tolerant Low-Diameter Clusters in Graphs
Integer models and upper bounds for the 3-club problem
Upper bounds and heuristics for the 2-club problem
On atomic cliques in temporal graphs
On solving simplified diversified top-k\,s-plex problem
Finding conserved low-diameter subgraphs in social and biological networks
Cluster vertex deletion problems on cubic graphs
A dynamic programming algorithm for the maximum s-club problem on trees
An efficient iterated local search for the minimum quasi-clique partitioning problem

Describes a project that uses

Uses Software

Algorithm 457

This page was built for publication: Heuristics for finding \(k\)-clubs in an undirected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1977620)