Fixed-Parameter Enumerability of Cluster Editing and Related Problems
- 16 July 2008
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 46 (2) , 261-283
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A More Effective Linear Kernelization for Cluster EditingLecture Notes in Computer Science, 2007
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartizationJournal of Computer and System Sciences, 2006
- Parameterized enumeration, transversals, and imperfect phylogeny reconstructionTheoretical Computer Science, 2006
- Local modeling of global interactome networksBioinformatics, 2005
- Cluster graph modification problemsDiscrete Applied Mathematics, 2004
- Correlation ClusteringMachine Learning, 2004
- Automated Generation of Search Tree Algorithms for Hard Graph Modification ProblemsAlgorithmica, 2004
- Simultaneous Clustering and Dynamic Keyword Weighting for Text Documents2004
- Computing Phylogenetic Roots with Bounded Degrees and ErrorsSIAM Journal on Computing, 2003
- NP-hard problems in hierarchical-tree clusteringActa Informatica, 1986