On the parameterized complexity of s-club cluster deletion problems
From MaRDI portal
Recommendations
- On the parameterized complexity of \(s\)-club cluster deletion problems
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- Complexity of the cluster deletion problem on subclasses of chordal graphs
- s-club cluster vertex deletion on interval and well-partitioned chordal graphs
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- An improved parameterized algorithm for the p-cluster vertex deletion problem
- The complexity of the simultaneous cluster problem
- The cluster deletion problem for cographs
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
Cites work
- A 2k kernel for the cluster editing problem
- A golden ratio parameterized algorithm for cluster editing
- A graph‐theoretic definition of a sociometric clique†
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- Cluster editing with locally bounded modifications
- Cluster graph modification problems
- Correlation clustering
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Faster parameterized algorithm for cluster vertex deletion
- Graph clustering
- Graph minors. II. Algorithmic aspects of tree-width
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- Multivariate algorithmics for finding cohesive subnetworks
- Novel approaches for analyzing biological networks
- On Editing Graphs into 2-Club Clusters
- On the parameterized complexity of s-club cluster deletion problems
- On the tractability of covering a graph with 2-clubs
- Subexponential algorithm for d-cluster edge deletion: exception or rule?
- The node-deletion problem for hereditary properties is NP-complete
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Treewidth. Computations and approximations
Cited in
(6)- On the parameterized complexity of s-club cluster deletion problems
- On the parameterized complexity of \(s\)-club cluster deletion problems
- Preface
- \( \gamma \)-clustering problems: classical and parametrized complexity
- Cluster vertex deletion problems on cubic graphs
- On the parameterized complexity of s-club cluster edge deletion
This page was built for publication: On the parameterized complexity of s-club cluster deletion problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6165557)
