On the Fixed-Parameter Enumerability of Cluster Editing
Author:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 283-294
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Cluster graph modification problemsDiscrete Applied Mathematics, 2004
- Automated Generation of Search Tree Algorithms for Hard Graph Modification ProblemsAlgorithmica, 2004
- Finding k Disjoint Triangles in an Arbitrary GraphLecture Notes in Computer Science, 2004
- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps2004
- CLICK and EXPANDER: a system for clustering and visualizing gene expression dataBioinformatics, 2003
- Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation2003
- Computing Phylogenetic Roots with Bounded Degrees and ErrorsSIAM Journal on Computing, 2003
- On Parameterized Enumeration2002
- Parameterized Complexity1999
- Combinatorial Relations and Chromatic GraphsCanadian Journal of Mathematics, 1955