Efficient Parameterized Preprocessing for Cluster Editing
From MaRDI portal
Publication:5444970
DOI10.1007/978-3-540-74240-1_27zbMath1135.68511OpenAlexW1520351179MaRDI QIDQ5444970
No author found.
Publication date: 26 February 2008
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_27
Related Items
A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing ⋮ On Making Directed Graphs Transitive ⋮ Graph-Based Data Clustering with Overlaps ⋮ Cluster Editing ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Improved Algorithms for Bicluster Editing ⋮ A \(2k\) kernel for the cluster editing problem ⋮ On making directed graphs transitive ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems ⋮ A cubic-vertex kernel for flip consensus tree ⋮ Graph-based data clustering with overlaps ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Editing graphs into disjoint unions of dense clusters ⋮ Cluster editing: kernelization based on edge cuts ⋮ Iterative compression and exact algorithms ⋮ Clustering with partial information ⋮ Kernels for packing and covering problems ⋮ A Problem Kernelization for Graph Packing ⋮ Clustering with Partial Information ⋮ Iterative Compression and Exact Algorithms ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ Cluster Editing: Kernelization Based on Edge Cuts ⋮ On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Fixed-Parameter Algorithms for Cluster Vertex Deletion ⋮ Alternative Parameterizations for Cluster Editing ⋮ A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing ⋮ A simple and improved parameterized algorithm for bicluster editing ⋮ A linear-time kernelization for the rooted \(k\)-leaf outbranching problem
