A More Effective Linear Kernelization for Cluster Editing
Author:
- 14 September 2007
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 36-47
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The Cluster Editing Problem: Implementations and Experiments2006
- Error Compensation in Leaf Power ProblemsAlgorithmica, 2005
- Clustering with qualitative informationJournal of Computer and System Sciences, 2005
- Extending the Tractability Border for Closest Leaf PowersLecture Notes in Computer Science, 2005
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size2005
- Correlation ClusteringMachine Learning, 2004
- Polynomial-time data reduction for dominating setJournal of the ACM, 2004
- Computing Phylogenetic Roots with Bounded Degrees and ErrorsSIAM Journal on Computing, 2003
- Clustering Gene Expression PatternsJournal of Computational Biology, 1999
- Parameterized Complexity1999