
Edge Deletion to Restrict the Size of an Epidemic
Given a graph G=(V,E), a set ℱ of forbidden subgraphs, we study ℱFree E...
read it

Losing Treewidth by Separating Subsets
We study the problem of deleting the smallest set S of vertices (resp.ed...
read it

Tractability of Konig Edge Deletion Problems
A graph is said to be a Konig graph if the size of its maximum matching ...
read it

FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More
For a hereditary graph class ℋ, the ℋelimination distance of a graph G ...
read it

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results
The focus of this paper is two fold. Firstly, we present a logical appro...
read it

The Complexity of Connectivity Problems in ForbiddenTransition Graphs and EdgeColored Graphs
The notion of forbiddentransition graphs allows for a robust generaliza...
read it

QBF as an Alternative to Courcelle's Theorem
We propose reductions to quantified Boolean formulas (QBF) as a new appr...
read it
FixedTreewidthEfficient Algorithms for EdgeDeletion to Intersection Graph Classes
For a graph class 𝒞, the 𝒞EdgeDeletion problem asks for a given graph G to delete the minimum number of edges from G in order to obtain a graph in 𝒞. We study the 𝒞EdgeDeletion problem for 𝒞 the permutation graphs, interval graphs, and other related graph classes. It follows from Courcelle's Theorem that these problems are fixed parameter tractable when parameterized by treewidth. In this paper, we present concrete FPT algorithms for these problems. By giving explicit algorithms and analyzing these in detail, we obtain algorithms that are significantly faster than the algorithms obtained by using Courcelle's theorem.
READ FULL TEXT
Comments
There are no comments yet.