Cluster Editing with Locally Bounded Modifications Revisited [chapter]

Peter Damaschke
2013 Lecture Notes in Computer Science  
For Cluster Editing where both the number of clusters and the edit degree are bounded, we speed up the kernelization by almost a factor n compared to Komusiewicz and Uhlmann (2012) , at cost of a marginally worse kernel size bound. We also give sufficient conditions for a subset of vertices to be a cluster in some optimal clustering.
doi:10.1007/978-3-642-45278-9_38 fatcat:jecsuoqwvngg3nbprs4y647whq