\(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
From MaRDI portal
Publication:6039419
DOI10.1007/978-3-031-15914-5_10arXiv2210.07699OpenAlexW4312519980MaRDI QIDQ6039419
L. Sunil Chandran, Raji R. Pillai, Dibyayan Chakraborty, Sajith Padinhatteeri
Publication date: 5 May 2023
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.07699
Related Items (1)
Cites Work
- A fast branching algorithm for cluster vertex deletion
- Graph-based data clustering with overlaps
- Approximate association via dissociation
- Correlation clustering
- Fixed-parameter algorithms for cluster vertex deletion
- The node-deletion problem for hereditary properties is NP-complete
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Vertex deletion problems on chordal graphs
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Faster parameterized algorithm for cluster vertex deletion
- Well-partitioned chordal graphs: obstruction set and disjoint paths
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- Improved approximation algorithms for hitting 3-vertex paths
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Novel approaches for analyzing biological networks
- Three problems on well-partitioned chordal graphs
- On Editing Graphs into 2-Club Clusters
- The Cluster Editing Problem: Implementations and Experiments
- A graph‐theoretic definition of a sociometric clique†
- A Faster Deterministic Maximum Flow Algorithm
- Subquadratic Kernels for Implicit 3-H <scp>itting</scp> S <scp>et</scp> and 3-S <scp>et</scp> P <scp>acking</scp> Problems
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
- Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs
- Exact Algorithms via Monotone Local Search
- Node-and edge-deletion NP-complete problems
- Max flows in O(nm) time, or better
- A tight approximation algorithm for the cluster vertex deletion problem
This page was built for publication: \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
