Further parameterized algorithms for the F-free edge deletion problem

[PDF] arxiv.org

Efficient Approximation for Subgraph-Hitting Problems in Sparse Graphs and Geometric Intersection Graphs

Z Dvořák, D Lokshtanov, F Panolan, S Saurabh… - arXiv preprint arXiv …, 2023 - arxiv.org
We investigate a fundamental vertex-deletion problem called (Induced) Subgraph Hitting:
given a graph $ G $ and a set $\mathcal {F} $ of forbidden graphs, the goal is to compute a …
被引用次数：3 相关文章 所有 2 个版本

Parameterized Complexity of the -Free Edge Deletion Problem

A Gaikwad, S Maity - … Symposium on Fundamentals of Computation Theory, 2023 - Springer
Given an undirected graph G=(V, E) and two integers k and h, we study T h+ 1-Free Edge
Deletion, where the goal is to remove at most k edges such that the resulting graph does not …
相关文章 所有 3 个版本