Exact Algorithms for Cluster Editing: Evaluation and Experiments
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2009/07/15
-
Journal
-
Indian UGC (journal)
-
Refrences20
-
Citations35
-
Sebastian Böcker
-
Sebastian Briesemeister
-
Gunnar W. Klau
Cite
Böcker, Sebastian, et al. “Exact Algorithms for Cluster Editing: Evaluation and Experiments”. Algorithmica, vol. 60, no. 2, 2009, pp. 316-34, https://doi.org/10.1007/s00453-009-9339-7.
Böcker, S., Briesemeister, S., & Klau, G. W. (2009). Exact Algorithms for Cluster Editing: Evaluation and Experiments. Algorithmica, 60(2), 316-334. https://doi.org/10.1007/s00453-009-9339-7
Böcker S, Briesemeister S, Klau GW. Exact Algorithms for Cluster Editing: Evaluation and Experiments. Algorithmica. 2009;60(2):316-34.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A more effective linear kernelization for cluster editing | Theoretical Computer Science |
| 40 | 2009 |
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing | BMC Bioinformatics |
| 39 | 2007 |
| Clustering with qualitative information | Journal of Computer and System Sciences |
| 79 | 2005 |
| Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation | Theory of Computing Systems |
| 47 | 2005 |
| Clustering of Microarray data via Clique Partitioning | Journal of Combinatorial Optimization |
| 23 | 2005 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 10
is the most frequently represented among the references in this article. It primarily includes studies from Mathematical Programming and BMC Bioinformatics. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| CP-Lib: Benchmark Instances of the Clique Partitioning Problem | Mathematical Programming Computation |
| 2023 | |
| (1,1)-Cluster Editing is polynomial-time solvable | Discrete Applied Mathematics |
| 2023 | |
| User-generated short-text classification using cograph editing-based network clustering with an application in invoice categorization | Data & Knowledge Engineering |
| 2023 | |
| An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion | Theoretical Computer Science |
| 1 | 2023 |
Cluster Editing Parameterized above Modification-disjoint
P
3
-packings | ACM Transactions on Algorithms |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 16
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Comprehensive cluster analysis with Transitivity Clustering and was published in 2011. The most recent citation comes from a 2023 study titled CP-Lib: Benchmark Instances of the Clique Partitioning Problem. This article reached its peak citation in 2023, with 5 citations. It has been cited in 23 different journals, 17% of which are open access. Among related journals, the Discrete Applied Mathematics cited this research the most, with 5 citations. The chart below illustrates the annual citation trends for this article.