Algorithms for the maximum k-club problem in graphs
From MaRDI portal
Publication:385488
DOI10.1007/S10878-012-9473-ZzbMATH Open1282.90220OpenAlexW2077064858MaRDI QIDQ385488FDOQ385488
Recommendations
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- 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
- Heuristics for finding \(k\)-clubs in an undirected graph
Cites Work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- A fast algorithm for the maximum clique problem
- A variable neighborhood search for graph coloring.
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Handbook of metaheuristics
- Heuristics for finding \(k\)-clubs in an undirected graph
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Integer models and upper bounds for the 3-club problem
- Local search and suffix tree for car-sequencing problem with colors
- Neighborhood structures for the container loading problem: a VNS implementation
- New methods to color the vertices of a graph
- Novel approaches for analyzing biological networks
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Parameterized computational complexity of finding small-diameter subgraphs
- Solving the maximum clique problem using a tabu search approach
- The parallel variable neighborhood search for the \(p\)-median problem
- Upper bounds and heuristics for the 2-club problem
- Variable neighborhood search
- Variable neighborhood search for the maximum clique
- Variable neighborhood search: Principles and applications
Cited In (31)
- Parsimonious formulations for low-diameter clusters
- On the maximum small-world subgraph problem
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- The triangle \(k\)-club problem
- On the maximum locally clustered subgraph and some related problems
- On biconnected and fragile subgraphs of low diameter
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Covering a graph with clubs
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club
- On the 2-club polytope of graphs
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms
- Two-phase heuristics for the \(k\)-club problem
- Combinatorial algorithms for the maximum \(k\)-plex problem
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- A polyhedral study of the maximum edge subgraph problem
- Upper bounds and heuristics for the 2-club problem
- Finding large \(k\)-clubs in undirected graphs
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- Local search for diversified top-\(k\) clique search problem
- A survey on optimization studies of group centrality metrics
- Finding conserved low-diameter subgraphs in social and biological networks
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Cliques and clubs
- Heuristics for finding \(k\)-clubs in an undirected graph
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Covering with clubs: complexity and approximability
Uses Software
This page was built for publication: Algorithms for the maximum \(k\)-club problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385488)
