A More Effective Linear Kernelization for Cluster Editing

DOI10.1007/978-3-540-74450-4_4zbMath1176.05078OpenAlexW2799438837MaRDI QIDQ3611894

Jiong Guo

Publication date: 3 March 2009

Published in: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74450-4_4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (21)

Reducing rank of the adjacency matrix by graph modification ⋮ Reducing Rank of the Adjacency Matrix by Graph Modification ⋮ Polynomial kernels for 3-leaf power graph modification problems ⋮ Improved Algorithms for Bicluster Editing ⋮ Exact Algorithms for Cluster Editing: Evaluation and Experiments ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ A cubic kernel for feedback vertex set and loop cutset ⋮ Fixed-parameter enumerability of cluster editing and related problems ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Clustering with partial information ⋮ Applying modular decomposition to parameterized cluster editing problems ⋮ A Problem Kernelization for Graph Packing ⋮ Clustering with Partial Information ⋮ Iterative Compression and Exact Algorithms ⋮ Fixed-parameter algorithms for cluster vertex deletion ⋮ Closest 4-leaf power is fixed-parameter tractable ⋮ Fixed-Parameter Algorithms for Cluster Vertex Deletion ⋮ A more effective linear kernelization for cluster editing ⋮ Going Weighted: Parameterized Algorithms for Cluster Editing

This page was built for publication: A More Effective Linear Kernelization for Cluster Editing