On the parameterized complexity of s-club cluster deletion problems
From MaRDI portal
Publication:6165557
DOI10.1016/j.tcs.2023.114041OpenAlexW4381194450MaRDI QIDQ6165557
Fabrizio Montecchiani, Giacomo Ortali, Alessandra Tappini, Tommaso Piselli
Publication date: 1 August 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114041
Related Items
On the parameterized complexity of s-club cluster deletion problems ⋮ On the parameterized complexity of \(s\)-club cluster deletion problems
Cites Work
- Unnamed Item
- Unnamed Item
- A \(2k\) kernel for the cluster editing problem
- Graph clustering
- Correlation clustering
- Cluster editing with locally bounded modifications
- The node-deletion problem for hereditary properties is NP-complete
- Treewidth. Computations and approximations
- Multivariate algorithmics for finding cohesive subnetworks
- Cluster graph modification problems
- A golden ratio parameterized algorithm for cluster editing
- Faster parameterized algorithm for cluster vertex deletion
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Novel approaches for analyzing biological networks
- On Editing Graphs into 2-Club Clusters
- Graph minors. II. Algorithmic aspects of tree-width
- A graph‐theoretic definition of a sociometric clique†
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- On the tractability of covering a graph with 2-clubs
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- On the parameterized complexity of s-club cluster deletion problems
This page was built for publication: On the parameterized complexity of s-club cluster deletion problems
