Component order connectivity in directed graphs
A directed graph D is semicomplete if for every pair x, y of vertices of D, there is at least one
arc between x and y. Thus, a tournament is a semicomplete digraph. In the Directed …
arc between x and y. Thus, a tournament is a semicomplete digraph. In the Directed …
Hitting long directed cycles is fixed-parameter tractable
In the Directed Long Cycle Hitting Set} problem we are given a directed graph $ G $, and the
task is to find a set $ S $ of at most $ k $ vertices/arcs such that $ GS $ has no cycle of length …
task is to find a set $ S $ of at most $ k $ vertices/arcs such that $ GS $ has no cycle of length …
Parameterized algorithms for generalizations of directed feedback vertex set
Abstract The Directed Feedback Vertex Set (DFVS) problem takes as input a directed graph
G and seeks a smallest vertex set S that hits all cycles in G. This is one of Karp's 21 NP …
G and seeks a smallest vertex set S that hits all cycles in G. This is one of Karp's 21 NP …
Vertex Deletion Problems
A Göke - 2022 - bonndoc.ulb.uni-bonn.de
In this thesis we study various vertex deletion problems. In a vertex deletion problem, we are
given a graph G and an integer k, and want to delete at most k vertices from G such that the …
given a graph G and an integer k, and want to delete at most k vertices from G such that the …