Faster Parameterized Algorithm for Cluster Vertex Deletion
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2020/10/24
-
Journal
-
Indian UGC (journal)
-
Refrences17
-
Citations7
-
Dekel Tsur ORCID (unauthenticated)
Cite
Tsur, Dekel. “Faster Parameterized Algorithm for Cluster Vertex Deletion”. Theory of Computing Systems, vol. 65, no. 2, 2020, pp. 323-4, https://doi.org/10.1007/s00224-020-10005-w.
Tsur, D. (2020). Faster Parameterized Algorithm for Cluster Vertex Deletion. Theory of Computing Systems, 65(2), 323-343. https://doi.org/10.1007/s00224-020-10005-w
Tsur, Dekel. “Faster Parameterized Algorithm for Cluster Vertex Deletion”. Theory of Computing Systems 65, no. 2 (2020): 323-43. https://doi.org/10.1007/s00224-020-10005-w.
Tsur D. Faster Parameterized Algorithm for Cluster Vertex Deletion. Theory of Computing Systems. 2020;65(2):323-4.
Journal Categories
Science
Mathematics
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
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A faster FPT algorithm for 3-path vertex cover | Information Processing Letters |
| 25 | 2016 |
| A Fast Branching Algorithm for Cluster Vertex Deletion | Theory of Computing Systems |
| 24 | 2016 |
| A fixed-parameter algorithm for the vertex cover P3 problem | Information Processing Letters |
| 27 | 2015 |
| Iterative compression and exact algorithms | Theoretical Computer Science |
| 18 | 2010 |
| A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set | Algorithmica |
| 10 | 2010 |
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 Theory of Computing Systems and Algorithmica. 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 |
|---|---|---|---|---|
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs | Theory of Computing Systems |
| 2024 | |
| s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs | Discrete Applied Mathematics |
| 2024 | |
| Algorithms for 2-club cluster deletion problems using automated generation of branching rules | Theoretical Computer Science |
| 2024 | |
| On the d-Claw Vertex Deletion Problem | Algorithmica |
| 1 | 2023 |
| Faster parameterized algorithms for two vertex deletion problems | Theoretical Computer Science |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 6
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Streaming deletion problems parameterized by vertex cover and was published in 2023. The most recent citation comes from a 2024 study titled Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. This article reached its peak citation in 2023, with 4 citations. It has been cited in 4 different journals. Among related journals, the Theoretical Computer Science cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.