Image de couverture de livre

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Le, Hoang-Oanh, Le, Van Bang
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Computational Complexity Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
par: Feghali, Carl, et autres
Publié: (2025)

The complexity of strong conflict-free vertex-connection $k$-colorability
par: Hsieh, Sun-Yuan, et autres
Publié: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
par: Beisegel, Jesse, et autres
Publié: (2025)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
par: Le, Hoang-Oanh, et autres
Publié: (2023)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Exact Algorithms for Edge Deletion to Cactus
par: Akhtar, Sheikh Shakil, et autres
Publié: (2026)

The Complexity of Cluster Vertex Splitting and Company
par: Firbas, Alexander, et autres
Publié: (2023)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
par: Hsieh, Jun-Ting, et autres
Publié: (2024)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
par: Eagling-Vose, Tala, et autres
Publié: (2025)

Isometric path complexity of graphs
par: Chakraborty, Dibyayan, et autres
Publié: (2022)

On graphs coverable by k shortest paths
par: Dumas, Maël, et autres
Publié: (2022)

(Independent) Roman Domination Parameterized by Distance to Cluster
par: Ashok, Pradeesha, et autres
Publié: (2024)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
par: Foucaud, Florent, et autres
Publié: (2024)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
par: Bousquet, Nicolas, et autres
Publié: (2025)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
par: Cordasco, Gennaro, et autres
Publié: (2024)

Steiner Forest for $H$-Subgraph-Free Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2026)

Finding $d$-Cuts in Probe $H$-Free Graphs
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Explicit Lossless Vertex Expanders
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
par: Ahn, Jungho, et autres
Publié: (2026)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
par: Lucke, Felicia, et autres
Publié: (2023)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
par: Lucke, Felicia, et autres
Publié: (2024)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
par: Aute, Shubhada, et autres
Publié: (2026)

Graph Search Trees and the Intermezzo Problem
par: Beisegel, Jesse, et autres
Publié: (2024)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
par: Mary, Arnaud
Publié: (2024)

Computing Hamiltonian Paths with Partial Order Restrictions
par: Beisegel, Jesse, et autres
Publié: (2024)

An efficient uniqueness theorem for overcomplete tensor decomposition
par: Koiran, Pascal
Publié: (2024)

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
par: Dallard, Clément, et autres
Publié: (2024)

Distance Vector Domination
par: Cordasco, Gennaro, et autres
Publié: (2024)

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
par: Beisegel, Jesse, et autres
Publié: (2024)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
par: Bedert, Benjamin, et autres
Publié: (2025)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
par: Hsieh, Jun-Ting, et autres
Publié: (2026)

Space Efficient Algorithms for Parameterised Problems
par: Akhtar, Sheikh Shakil, et autres
Publié: (2025)

An unconditional lower bound for the active-set method on the hypercube
par: Disser, Yann, et autres
Publié: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

An unconditional lower bound for the active-set method in convex quadratic maximization
par: Bach, Eleon, et autres
Publié: (2025)

A Fixed-Parameter Algorithm for the Kneser Problem
par: Haviv, Ishay
Publié: (2022)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
par: Hellmuth, Marc, et autres
Publié: (2023)

Graph Classes Closed under Self-intersection
par: Dabrowski, Konrad K., et autres
Publié: (2025)

On a tree-based variant of bandwidth and forbidding simple topological minors
par: Jacob, Hugo, et autres
Publié: (2025)