When can Cluster Deletion with bounded weights be solved efficiently?
Authors:
- Jaroslav GarvardtJGJaroslav Garvardt
- Christian KomusiewiczCKChristian Komusiewicz
- Nils MorawietzNMNils Morawietz
Open Access
- 22 December 2025
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 383, 169-183
Abstract
No abstract availableFunding Information
- Carl-Zeiss-Stiftung
This publication has 27 references indexed in Scilit:
- Structural Parameterization of Cluster DeletionAlgorithmica, 2025
- Cluster Deletion on Interval Graphs and Split Related GraphsAlgorithmica, 2021
- Faster Parameterized Algorithm for Cluster Vertex DeletionTheory of Computing Systems, 2020
- Parameterized Aspects of Strong Subgraph ClosureAlgorithmica, 2020
- On the Relation of Strong Triadic Closure and Cluster DeletionAlgorithmica, 2019
- A Completeness Theory for Polynomial (Turing) KernelizationAlgorithmica, 2014
- Cluster Editing: Kernelization Based on Edge CutsAlgorithmica, 2011
- Applying Modular Decomposition to Parameterized Cluster Editing ProblemsTheory of Computing Systems, 2007
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955