Exact Algorithms for Cluster Editing: Evaluation and Experiments |
| |
| Authors: | Sebastian Böcker Sebastian Briesemeister Gunnar W. Klau |
| |
| Affiliation: | 1.Institut für Informatik,Friedrich-Schiller-Universit?t Jena,Jena,Germany;2.Jena Centre for Bioinformatics,Jena,Germany;3.Div. for Simulation of Biological Systems, ZBIT/WSI,Eberhard Karls Universit?t Tübingen,Tübingen,Germany;4.CWI,Amsterdam,Netherlands |
| |
| Abstract: | The Cluster Editing problem is defined as follows: Given an undirected, loopless graph, we want to find a set of edge modifications (insertions and deletions) of minimum cardinality, such that the modified graph consists of disjoint cliques. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
