An exact algorithm for the maximum quasi‐clique problem

DOI10.1111/ITOR.12637MaRDI QIDQ6088204zbMATH OpenFDO

Authors Celso C. Ribeiro, José A. Riveaux

Publication date 16 November 2023

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/ITOR.12637

zbMATH Keywords

graph densitygraphsmaximum \(\gamma \)-clique problemmaximum cardinality quasi-clique problemmaximum clique problemmaximum quasi-clique problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A branch-and-bound approach for maximum quasi-cliques
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1424314 (Why is no real title available?)
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• Introduction to algorithms
• On the maximum quasi-clique problem
• Reducibility among combinatorial problems
• The University of Florida sparse matrix collection

Cited in

(13)

• Exact algorithms for maximum clique: a computational study
• An opposition-based memetic algorithm for the maximum quasi-clique problem
• Near optimal solutions for maximum quasi-bicliques
• Mixed Integer Programming for Searching Maximum Quasi-Bicliques
• An Exact Algorithm for the Minimum Dominating Clique Problem
• hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
• 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
• A biased random-key genetic algorithm for the minimum quasi-clique partitioning problem
• Solving the multiobjective quasi-clique problem
• Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems

This page was built for publication: An exact algorithm for the maximum quasi‐clique problem

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