Efficient parameterized preprocessing for cluster editing

Authors:
Michael Fellows;Michael Langston;Frances Rosamond;Peter Shaw
Affiliations:
University of Newcastle, Callaghan NSW, Australia and Durham University, Institute of Advanced Study, Durham, United Kingdom;University of Tennessee, Knoxville, Tennessee;University of Newcastle, Callaghan NSW, Australia;University of Newcastle, Callaghan NSW, Australia
Venue:
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Year:
2007

Citing 13
Cited 22

NP-hard problems in hierarchical-tree clustering

Acta Informatica
Fixed-parameter tractability of graph modification problems for hereditary properties

Information Processing Letters
Correlation Clustering

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Cluster Graph Modification Problems

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems

Algorithmica
Clustering with qualitative information

Journal of Computer and System Sciences - Special issue: Learning theory 2003
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

Theoretical Computer Science - Parameterized and exact computation
Graph-modeled data clustering: fixed-parameter algorithms for clique generation

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Fixed-parameter tractable generalizations of cluster editing

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the fixed-parameter enumerability of cluster editing

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
The cluster editing problem: implementations and experiments

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized Complexity

Parameterized Complexity

Parameterized complexity of the clique partition problem

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Clustering with Partial Information

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Iterative Compression and Exact Algorithms

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Closest 4-leaf power is fixed-parameter tractable

Discrete Applied Mathematics
A Problem Kernelization for Graph Packing

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing

AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Graph-Based Data Clustering with Overlaps

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
On Making Directed Graphs Transitive

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Editing Graphs into Disjoint Unions of Dense Clusters

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Clustering with partial information

Theoretical Computer Science
Iterative compression and exact algorithms

Theoretical Computer Science
Improved algorithms for bicluster editing

TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Polynomial kernels for 3-leaf power graph modification problems

Discrete Applied Mathematics
A 2k Kernel for the cluster editing problem

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Alternative parameterizations for cluster editing

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
A 2k kernel for the cluster editing problem

Journal of Computer and System Sciences
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing

SIAM Journal on Discrete Mathematics
On making directed graphs transitive

Journal of Computer and System Sciences
Graph-based data clustering with overlaps

Discrete Optimization
Clustering with local restrictions

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the Cluster Editing problem, a graph is to be changed to a disjoint union of cliques by at most k operations of edge insertion or edge deletion. Improving on the best previously known quadratic-size polynomial-time kernelization, we describe how a crown-type structural reduction rule can be used to obtain a 6k kernelization bound.