The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
Cliques, holes and the vertex coloring polytope
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
A biased random-key genetic algorithm for the maximum quasi-clique problem
Solving the clique partitioning problem as a maximally diverse grouping problem
On the maximum quasi-clique problem
On exact solution approaches for the longest induced path problem
Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
Compact structure for sparse undirected graphs based on a clique graph partition
Finding influential communities in networks with multiple influence types
A community detection algorithm based on graph compression for large-scale social networks
An opposition-based memetic algorithm for the maximum quasi-clique problem
A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic
On clique relaxation models in network analysis
Managing and mining graph data
A branch-and-cut algorithm for graph coloring
A review on algorithms for maximum clique problems
LP-based dual bounds for the maximum quasi-clique problem
Solving longest common subsequence problems via a transformation to the maximum clique problem
New formulations and branch-and-cut procedures for the longest induced path problem
A survey on vertex coloring problems
A branch-and-cut algorithm for partition coloring
The clique partitioning problem: Facets and patching facets
Reducibility among Combinatorial Problems
A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy
Data reduction and exact algorithms for clique cover
An exact algorithm for the maximum quasi‐clique problem

This page was built for publication: The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study