Structural parameterization of cluster deletion
From MaRDI portal
Publication:6070784
DOI10.1007/978-3-031-27051-2_31OpenAlexW4324009747MaRDI QIDQ6070784
Charis Papadopoulos, Athanasios L. Konstantinidis, Giuseppe F. Italiano
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-27051-2_31
Cites Work
- Unnamed Item
- Unnamed Item
- The cluster deletion problem for cographs
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Correlation clustering
- Cluster editing with locally bounded modifications
- Going weighted: parameterized algorithms for cluster editing
- An application of simultaneous diophantine approximation in combinatorial optimization
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Cluster editing: kernelization based on edge cuts
- Algorithmic meta-theorems for restrictions of treewidth
- Cluster graph modification problems
- Cluster deletion on interval graphs and split related graphs
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- Cluster deletion revisited
- The graph motif problem parameterized by the structure of the input graph
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
- Integer Programming with a Fixed Number of Variables
- Alternative Parameterizations for Cluster Editing
- The Complexity of Multiterminal Cuts
- Motif and Hypergraph Correlation Clustering
- Parameterized Algorithms
- On the relation of strong triadic closure and cluster deletion
- Polynomial kernels for paw-free edge modification problems
This page was built for publication: Structural parameterization of cluster deletion
