Algorithms for 2-club cluster deletion problems using automated generation of branching rules
From MaRDI portal
Publication:6140356
DOI10.1016/j.tcs.2023.114321OpenAlexW4389045676MaRDI QIDQ6140356
Publication date: 2 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114321
algorithmsgraph algorithmsparameterized complexitycluster deletion problemautomated generation of branching rules
Cites Work
- A fast branching algorithm for cluster vertex deletion
- Graph-based data clustering with overlaps
- Exact exponential algorithms.
- Editing graphs into disjoint unions of dense clusters
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter algorithms for cluster vertex deletion
- Going weighted: parameterized algorithms for cluster editing
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- A golden ratio parameterized algorithm for cluster editing
- Even faster parameterized cluster deletion and cluster editing
- Faster parameterized algorithm for cluster vertex deletion
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
- Cluster deletion revisited
- Novel approaches for analyzing biological networks
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- On Editing Graphs into 2-Club Clusters
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- A graph‐theoretic definition of a sociometric clique†
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
