Polyhedral properties of the induced cluster subgraphs
From MaRDI portal
Publication:2022509
DOI10.1016/j.dam.2021.02.040zbMath1466.90088arXiv1904.12025OpenAlexW3136561472MaRDI QIDQ2022509
Sergiy I. Butenko, Seyedmohammadhossein Hosseinian
Publication date: 29 April 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.12025
Related Items
A tight approximation algorithm for the cluster vertex deletion problem ⋮ A tight approximation algorithm for the cluster vertex deletion problem ⋮ An improved approximation for maximum \(k\)-dependent set on bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast branching algorithm for cluster vertex deletion
- Graph clustering
- Approximate association via dissociation
- Spectral methods for graph clustering - a survey
- Cluster editing with locally bounded modifications
- The strong perfect graph theorem
- Fixed-parameter algorithms for cluster vertex deletion
- The node-deletion problem for hereditary properties is NP-complete
- On the complexity of testing for odd holes and induced odd paths
- Corrigendum to: On the complexity of testing for odd holes and induced odd paths
- A class of facet producing graphs for vertex packing polyhedra
- Geometric algorithms and combinatorial optimization.
- The generalized independent set problem: polyhedral analysis and solution approaches
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- A golden ratio parameterized algorithm for cluster editing
- The maximum number of induced open triangles in graphs of a given order
- The maximum independent union of cliques problem: complexity and exact approaches
- Improved approximation algorithms for hitting 3-vertex paths
- On clique relaxation models in network analysis
- Iterative compression and exact algorithms
- Algorithms for the generalized independent set problem based on a quadratic optimization approach
- A faster algorithm to recognize even-hole-free graphs
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- On a polynomial fractional formulation for independence number of a graph
- A polyhedral study of the generalized vertex packing problem
- Recognizing Berge graphs
- A review on algorithms for maximum clique problems
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
- Even-hole-free graphs part II: Recognition algorithm
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- The Cluster Editing Problem: Implementations and Experiments
- Node-Deletion NP-Complete Problems
- Lifting the facets of zero–one polytopes
- Technical Note—A Note on Zero-One Programming
- Vertex packings: Structural properties and algorithms
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- The disjoint cliques problem
- Properties of vertex packing and independence system polyhedra
- Reducibility among Combinatorial Problems
- Detecting an Odd Hole
- On the facial structure of set packing polyhedra
- Exact Algorithms via Monotone Local Search
- Cluster Editing
- Efficient algorithms for cluster editing
