Cluster deletion on interval graphs and split related graphs
type: Item
instance of: scholarly article
title: Cluster deletion on interval graphs and split related graphs
author: Athanasios L. Konstantinidis
author: Charis Papadopoulos
published in: Algorithmica
publication date: 2021-06-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/1904.09470
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10956/
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7365269
zbMATH Keywords: cluster deletion problem
zbMATH Keywords: interval graphs
zbMATH Keywords: split graphs
MaRDI profile type: Publication
OpenAlex ID: W3138047612
cites work: Correlation clustering
cites work: 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
cites work: Complexity of the cluster deletion problem on subclasses of chordal graphs
cites work: Graph Classes: A Survey
cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
cites work: Q3428631
cites work: Clustering with qualitative information
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
cites work: Q4193514
cites work: Incidence matrices and interval graphs
cites work: The cluster deletion problem for cographs
cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
cites work: Parameterized aspects of strong subgraph closure
cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
cites work: On the relation of strong triadic closure and cluster deletion
cites work: The splittance of a graph
cites work: Cluster analysis and mathematical programming
cites work: Q4148820
cites work: Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
cites work: Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
cites work: Cluster editing with locally bounded modifications
cites work: Strong triadic closure in cographs and graphs of low maximum degree
cites work: Q5092370
cites work: Maximizing the strong triadic closure in split graphs and proper interval graphs
cites work: Graph clustering
cites work: Cluster graph modification problems
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
DOI: 10.1007/S00453-021-00817-8
description: scientific article; zbMATH DE number 7365269