Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
From MaRDI portal
Publication:1634801
DOI10.1007/s11590-015-0971-7zbMath1414.90349OpenAlexW2180772693MaRDI QIDQ1634801
Esmaeel Moradi, Balabhaskar Balasundaram
Publication date: 18 December 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0971-7
Related Items
The triangle \(k\)-club problem ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ LP-based dual bounds for the maximum quasi-clique problem ⋮ On biconnected and fragile subgraphs of low diameter ⋮ Parsimonious formulations for low-diameter clusters ⋮ Graph signatures: identification and optimization ⋮ The maximum \(l\)-triangle \(k\)-club problem: complexity, properties, and algorithms ⋮ On the maximum small-world subgraph problem
Uses Software
Cites Work
- On finding \(k\)-cliques in \(k\)-partite graphs
- 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
- Upper bounds and heuristics for the 2-club problem
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Parameterized computational complexity of finding small-diameter subgraphs
- Heuristics for finding \(k\)-clubs in an undirected graph
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Novel approaches for analyzing biological networks
- Distance-Based Clique Relaxations in Networks: s-Clique and s-Club
- Clique Relaxation Models in Social Network Analysis
- On the 2-Club Polytope of Graphs
- A graph‐theoretic definition of a sociometric clique†
- On provably best construction heuristics for hard combinatorial optimization problems
- Integer models and upper bounds for the 3‐club problem
- Node-and edge-deletion NP-complete problems
- Canonical Cuts on the Unit Hypercube
