Cluster Editing: Kernelization Based on Edge Cuts
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2011/11/24
-
Journal
-
Indian UGC (journal)
-
Refrences23
-
Citations19
-
Yixin Cao
-
Jianer Chen
Cite
Cao, Yixin, and Jianer Chen. “Cluster Editing: Kernelization Based on Edge Cuts”. Algorithmica, vol. 64, no. 1, 2011, pp. 152-69, https://doi.org/10.1007/s00453-011-9595-1.
Cao, Y., & Chen, J. (2011). Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica, 64(1), 152-169. https://doi.org/10.1007/s00453-011-9595-1
Cao Y, Chen J. Cluster Editing: Kernelization Based on Edge Cuts. Algorithmica. 2011;64(1):152-69.
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 |
|---|---|---|---|---|
| Average parameterization and partial kernelization for computing medians | Journal of Computer and System Sciences |
| 16 | 2011 |
| A more effective linear kernelization for cluster editing | Theoretical Computer Science |
| 40 | 2009 |
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems | Mathematics of Operations Research |
| 33 | 2009 |
Aggregating inconsistent information | Journal of the ACM |
| 147 | 2008 |
Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing | BMC Bioinformatics |
| 39 | 2007 |
Refrences Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 6
is the most frequently represented among the references in this article. It primarily includes studies from Journal of the ACM and Machine Learning. 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 |
|---|---|---|---|---|
| A survey of parameterized algorithms and the complexity of edge modification | Computer Science Review |
| 1 | 2023 |
| (1,1)-Cluster Editing is polynomial-time solvable | Discrete Applied Mathematics |
| 2023 | |
Cluster Editing Parameterized above Modification-disjoint
P
3
-packings | ACM Transactions on Algorithms |
| 2023 | |
| (Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes | Algorithmica |
| 2 | 2022 |
| On Subgraph Complementation to H-free Graphs | Algorithmica |
| 2022 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 10
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters and was published in 2014. The most recent citation comes from a 2023 study titled Cluster Editing Parameterized above Modification-disjoint
P
3
-packings. This article reached its peak citation in 2022, with 4 citations. It has been cited in 11 different journals, 9% of which are open access. Among related journals, the Algorithmica cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.