(1,1)-Cluster Editing is polynomial-time solvable

Article Properties
Cite
Gutin, Gregory, and Anders Yeo. “(1,1)-Cluster Editing Is Polynomial-Time Solvable”. Discrete Applied Mathematics, vol. 340, 2023, pp. 259-71, https://doi.org/10.1016/j.dam.2023.07.002.
Gutin, G., & Yeo, A. (2023). (1,1)-Cluster Editing is polynomial-time solvable. Discrete Applied Mathematics, 340, 259-271. https://doi.org/10.1016/j.dam.2023.07.002
Gutin, Gregory, and Anders Yeo. “(1,1)-Cluster Editing Is Polynomial-Time Solvable”. Discrete Applied Mathematics 340 (2023): 259-71. https://doi.org/10.1016/j.dam.2023.07.002.
Gutin G, Yeo A. (1,1)-Cluster Editing is polynomial-time solvable. Discrete Applied Mathematics. 2023;340:259-71.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Vulnerability rating of source code with token embedding and combinatorial algorithms International Journal of Semantic Computing
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 2020
Cluster editing with locally bounded modifications Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
 46 2012
A 2k kernel for the cluster editing problem Journal of Computer and System Sciences
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 32 2012
Cluster Editing: Kernelization Based on Edge Cuts Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 19 2012
Exact Algorithms for Cluster Editing: Evaluation and Experiments Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
 35 2011
Refrences Analysis
Category Category Repetition
Science: Mathematics: Instruments and machines: Electronic computers. Computer science11
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software6
Technology: Engineering (General). Civil engineering (General)6
Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware5
Science: Mathematics5
Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods4
Technology: Technology (General): Industrial engineering. Management engineering: Information technology2
Technology: Electrical engineering. Electronics. Nuclear engineering: Telecommunication2
Science: Science (General): Cybernetics: Information theory2
The category Science: Mathematics: Instruments and machines: Electronic computers. Computer science 11 is the most frequently represented among the references in this article. It primarily includes studies from Journal of Discrete Algorithms and Theoretical Computer Science. The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year