Algorithms and complexity of \(s\)-club cluster vertex deletion
type: Item
instance of: scholarly article
title: Algorithms and complexity of \(s\)-club cluster vertex deletion
DOI: 10.1007/978-3-030-79987-8_11
author: Dibyayan Chakraborty
author: L. Sunil Chandran
author: Sajith Padinhatteeri
author: Raji R. Pillai
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495020
zbMATH Keywords: vertex deletion problem
zbMATH Keywords: \(s\)-club
zbMATH Keywords: split graphs
zbMATH Keywords: (planar) bipartite graphs
zbMATH Keywords: NP-hardness
zbMATH Keywords: APX-hardness
zbMATH Keywords: trapezoid graphs
zbMATH Keywords: polynomial-time algorithms
describes a project that uses: solverALL
MaRDI profile type: Publication
full work available at URL: 978-3-030-79987-8 11
OpenAlex ID: W3176095703
cites work: Approximating Maximum Diameter-Bounded Subgraphs
cites work: Novel approaches for analyzing biological networks
cites work: An efficient algorithm for finding all hinge vertices on trapezoid graphs
cites work: Treewidth and Minimum Fill-in on d-Trapezoid Graphs
cites work: Vertex deletion problems on chordal graphs
cites work: Finding large \(k\)-clubs in undirected graphs
cites work: Distances in cocomparability graphs and their powers
cites work: Trapezoid graphs and generalizations, geometry and algorithms
cites work: Q4198056
cites work: On structural parameterizations for the 2-club problem
cites work: An efficient algorithm for finding a maximum weight \(k\)-independent set of trapezoid graphs
cites work: Fixed-parameter algorithms for cluster vertex deletion
cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
cites work: Linear Time LexDFS on Cocomparability Graphs.
cites work: A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs
cites work: Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: On Editing Graphs into 2-Club Clusters
cites work: The recognition of triangle graphs
cites work: Hitting forbidden induced subgraphs on bounded treewidth graphs
cites work: Parameterized computational complexity of finding small-diameter subgraphs
cites work: A recognition algorithm for simple-triangle graphs
cites work: Node-and edge-deletion NP-complete problems
description: scientific article; zbMATH DE number 7495020