Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2019/06/20
-
Journal
-
Indian UGC (journal)
-
Refrences36
-
Citations8
-
Matthew Johnson ORCID (unauthenticated)
-
Giacomo Paesani ORCID (unauthenticated)
-
Daniël Paulusma ORCID (unauthenticated)
Cite
Johnson, Matthew, et al. “Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs”. Algorithmica, vol. 82, no. 1, 2019, pp. 20-40, https://doi.org/10.1007/s00453-019-00601-9.
Johnson, M., Paesani, G., & Paulusma, D. (2019). Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs. Algorithmica, 82(1), 20-40. https://doi.org/10.1007/s00453-019-00601-9
Johnson, Matthew, Giacomo Paesani, and Daniël Paulusma. “Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs”. Algorithmica 82, no. 1 (2019): 20-40. https://doi.org/10.1007/s00453-019-00601-9.
Johnson M, Paesani G, Paulusma D. Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs. Algorithmica. 2019;82(1):20-4.
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 |
|---|---|---|---|---|
| Independent Feedback Vertex Set for $$P_5$$ P 5 -Free Graphs | Algorithmica |
| 13 | 2019 |
| Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity | Theoretical Computer Science |
| 9 | 2018 |
| Maximum weight independent set for ℓclaw-free graphs in polynomial time | Discrete Applied Mathematics |
| 9 | 2018 |
| Boundary classes for graph problems involving non-local properties | Theoretical Computer Science |
| 9 | 2017 |
A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs | Journal of Graph Theory |
| 66 | 2017 |
Refrences Analysis
The category
Science: Mathematics 13
is the most frequently represented among the references in this article. It primarily includes studies from Algorithmica and Discrete Applied Mathematics. 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 | |
| On the price of independence for vertex cover, feedback vertex set and odd cycle transversal | European Journal of Combinatorics |
| 2024 | |
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs | Algorithmica |
| 2023 | |
| A Metaheuristic Algorithm for Vertex Cover based Link Monitoring and Backbone Formation in Wireless Ad hoc Networks | Expert Systems with Applications |
| 5 | 2023 |
| Computing Weighted Subset Odd Cycle Transversals in H-free graphs | Journal of Computer and System Sciences |
| 2022 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software 5
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest and was published in 2020. 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 2022, with 3 citations. It has been cited in 7 different journals. Among related journals, the Algorithmica cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.