The maximum independent union of cliques problem: complexity and exact approaches
From MaRDI portal
Publication:2174276
Recommendations
- Polyhedral properties of the induced cluster subgraphs
- A fast algorithm for the maximum clique problem
- Strong triadic closure in cographs and graphs of low maximum degree
- scientific article; zbMATH DE number 753971
- Improved approximations of independent sets in bounded-degree graphs
- scientific article; zbMATH DE number 522858
- Maximum colorful independent sets in vertex-colored graphs
- Strong triadic closure in cographs and graphs of low maximum degree
- Approximating maximum independent sets by excluding subgraphs
- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 1354124 (Why is no real title available?)
- A fast branching algorithm for cluster vertex deletion
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- Claw-free graphs---a survey
- Cluster editing with locally bounded modifications
- Cluster graph modification problems
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Efficient algorithms for cluster editing
- Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph
- Even faster parameterized cluster deletion and cluster editing
- Fixed-parameter algorithms for cluster vertex deletion
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Maximum weight relaxed cliques and Russian doll search revisited
- Node-and edge-deletion NP-complete problems
- On a polynomial fractional formulation for independence number of a graph
- On connected dominating sets of restricted diameter
- On graphs with polynomially solvable maximum-weight clique problem
- On the Maximum Weight Clique Problem
- Planar Formulae and Their Uses
- Probabilistic checking of proofs
- Reducibility among combinatorial problems
- Russian doll search for the Steiner triple covering problem
- Subquadratic kernels for implicit 3-hitting set and 3-set packing problems
- The Cluster Editing Problem: Implementations and Experiments
- The disjoint cliques problem
- The maximum clique problem
- The maximum number of induced open triangles in graphs of a given order
Cited in
(10)- On independent cliques and linear complementarity problems
- Maximizing dominance in the plane and its applications
- An improved approximation for maximum \(k\)-dependent set on bipartite graphs
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- Learning driven three-phase search for the maximum independent union of cliques problem
- Finding independent sets in unions of perfect graphs
- On the complexity of finding a potential community
- Polyhedral properties of the induced cluster subgraphs
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- Asymptotic bounds for clustering problems in random graphs
This page was built for publication: The maximum independent union of cliques problem: complexity and exact approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174276)
