Algorithms for the maximum k-club problem in graphs
From MaRDI portal
Publication:385488
DOI10.1007/S10878-012-9473-ZzbMATH Open1282.90220OpenAlexW2077064858MaRDI QIDQ385488FDOQ385488
Shahram Shahinpour, Sergiy Butenko
Publication date: 2 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9473-z
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
- Title not available (Why is that?)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Variable neighborhood search
- A fast algorithm for the maximum clique problem
- Novel approaches for analyzing biological networks
- Variable neighborhood search: Principles and applications
- New methods to color the vertices of a graph
- Neighborhood structures for the container loading problem: a VNS implementation
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- Solving the maximum clique problem using a tabu search approach
- Handbook of metaheuristics
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- The parallel variable neighborhood search for the \(p\)-median problem
- Heuristics for finding \(k\)-clubs in an undirected graph
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Integer models and upper bounds for the 3‐club problem
- Upper bounds and heuristics for the 2-club problem
- Variable neighborhood search for the maximum clique
- A variable neighborhood search for graph coloring.
- Parameterized computational complexity of finding small-diameter subgraphs
- Local search and suffix tree for car-sequencing problem with colors
Cited In (16)
- Parsimonious formulations for low-diameter clusters
- On the maximum small-world subgraph problem
- On biconnected and fragile subgraphs of low diameter
- Exact algorithms for the minimum \(s\)-club partitioning problem
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Frequency-driven tabu search for the maximum \(s\)-plex problem
- Two-phase heuristics for the \(k\)-club problem
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
- On the 2-Club Polytope of Graphs
- Finding large \(k\)-clubs in undirected graphs
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem
- A survey on optimization studies of group centrality metrics
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Heuristics for finding \(k\)-clubs in an undirected graph
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
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)
