Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs

Article Properties
Abstract
Cite
Le, Hoang-Oanh, and Van Bang Le. “Complexity of the (Connected) Cluster Vertex Deletion Problem on H-Free Graphs”. Theory of Computing Systems, vol. 68, no. 2, 2024, pp. 250-7, https://doi.org/10.1007/s00224-024-10161-3.
Le, H.-O., & Le, V. B. (2024). Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory of Computing Systems, 68(2), 250-270. https://doi.org/10.1007/s00224-024-10161-3
Le, Hoang-Oanh, and Van Bang Le. “Complexity of the (Connected) Cluster Vertex Deletion Problem on H-Free Graphs”. Theory of Computing Systems 68, no. 2 (2024): 250-70. https://doi.org/10.1007/s00224-024-10161-3.
1.
Le HO, Le VB. Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs. Theory of Computing Systems. 2024;68(2):250-7.
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 tight approximation algorithm for the cluster vertex deletion problem Mathematical Programming
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2 2023
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs

ACM Transactions on Algorithms
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • 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
10 2022
Faster Parameterized Algorithm for Cluster Vertex Deletion Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • 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
7 2021
Connected Vertex Cover for $$(sP_1+P_5)$$-Free Graphs 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)
8 2020
Tight Running Time Lower Bounds for Vertex Deletion Problems

ACM Transactions on Computation Theory
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
4 2018