Two novel results on the existence of 3-kernels in digraphs

12/22/2019
by   Alonso Ali, et al.
0

Let D be a digraph. We call a subset N of V(D)k-independent if for every pair of vertices u,v ∈ N, d(u,v) ≥ k; and we call it ℓ-absorbent if for every vertex u ∈ V(D) ∖ N, there exists v ∈ N such that d(u,v) ≤ℓ. A (k,ℓ)-kernel of D is a subset of vertices which is k-independent and ℓ-absorbent. A k-kernel is a (k,k-1)-kernel. In this report, we present the main results from our master's research regarding kernel theory. We prove that if a digraph D is strongly connected and every cycle C of D satisfies: (i) if C ≡ 0 3, then C has a short chord and (ii) if C ≢0 3, then C has three short chords: two consecutive and a third crossing one of the former, then D has a 3-kernel. Moreover, we introduce a modification of the substitution method, proposed by Meyniel and Duchet in 1983, for 3-kernels and use it to prove that a quasi-3-kernel-perfect digraph D is 3-kernel-perfect if every circuit of length not dividable by three has four short chords.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

07/08/2021

Algorithmic aspects of quasi-kernels

In a digraph, a quasi-kernel is a subset of vertices that is independent...
01/07/2018

Perfect graphs with polynomially computable kernels

In a directed graph, a kernel is a subset of vertices that is both stabl...
07/26/2021

On Kernels for d-Path Vertex Cover

In this paper we study the kernelization of d-Path Vertex Cover (d-PVC) ...
05/18/2021

A cubic vertex-kernel for Trivially Perfect Editing

We consider the Trivially Perfect Editing problem, where one is given an...
11/13/2017

Smaller parameters for vertex cover kernelization

We revisit the topic of polynomial kernels for Vertex Cover relative to ...
10/28/2021

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...
10/11/2020

A kernel-independent sum-of-Gaussians method by de la Vallée-Poussin sums

Approximation of interacting kernels by sum of Gaussians (SOG) is freque...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.