An exact algorithm for the maximum quasi‐clique problem
From MaRDI portal
Publication:6088204
DOI10.1111/itor.12637MaRDI QIDQ6088204
Celso Carneiro Ribeiro, José A. Riveaux
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
graphsmaximum clique problemgraph densitymaximum quasi-clique problemmaximum \(\gamma \)-clique problemmaximum cardinality quasi-clique problem
Related Items (5)
An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Polarization reduction by minimum‐cardinality edge additions: Complexity and integer programming approaches ⋮ Exact algorithms for the product configuration problem ⋮ The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
Cites Work
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
- A branch-and-bound approach for maximum quasi-cliques
- On the maximum quasi-clique problem
- The university of Florida sparse matrix collection
- Reducibility among Combinatorial Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An exact algorithm for the maximum quasi‐clique problem