On the parameterized complexity of \(s\)-club cluster deletion problems

DOI10.1007/978-3-031-23101-8_11arXiv2205.10834OpenAlexW4313429642MaRDI QIDQ6169520

Fabrizio Montecchiani, Tommaso Piselli, Giacomo Ortali, Alessandra Tappini

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.10834

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• A \(2k\) kernel for the cluster editing problem
• Graph clustering
• Correlation clustering
• Cluster editing with locally bounded modifications
• Treewidth. Computations and approximations
• Multivariate algorithmics for finding cohesive subnetworks
• Cluster graph modification problems
• A golden ratio parameterized algorithm for cluster editing
• 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