Cluster deletion on interval graphs and split related graphs
From MaRDI portal
Publication:2037103
DOI10.1007/s00453-021-00817-8OpenAlexW3138047612MaRDI QIDQ2037103
Athanasios L. Konstantinidis, Charis Papadopoulos
Publication date: 30 June 2021
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.09470
Related Items
Parameterized complexity of multicut in weighted trees, Structural parameterization of cluster deletion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- The cluster deletion problem for cographs
- Graph clustering
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- Correlation clustering
- Cluster editing with locally bounded modifications
- The splittance of a graph
- Cluster analysis and mathematical programming
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Cluster graph modification problems
- Parameterized aspects of strong subgraph closure
- Maximizing the strong triadic closure in split graphs and proper interval graphs
- 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
- Incidence matrices and interval graphs
- Clustering with qualitative information
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
- ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
- Graph Classes: A Survey
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
- On the relation of strong triadic closure and cluster deletion
- Strong triadic closure in cographs and graphs of low maximum degree
