Graph Modeled Data Clustering Fixed Parameter Algorithms for图模型数据聚类的固定参数算法.pptVIP

Graph Modeled Data Clustering: Fixed Parameter Algorithms for Clique Generation J. Gramm, J. Guo, F. Hüffner and R. Niedermeier Theory of Computing Systems (2005) Student: Vishal Kapoor Presentation Outline Problem Introduction Past Research Results of the paper CLUSTER EDITING Kernelization Search Tree CLUSTER DELETION Questions Problem Statement Make k changes to the edge set of an input graph to get vertex disjoint cliques. Each connected component is a clique in the resulting cluster graph CLUSTER EDITING Both edge additions and deletions are allowed CLUSTER DELETION Only edge deletions