Counting Kernels in Directed Graphs with Arbitrary Orientations

02/09/2022
by   Bruno Jartoux, et al.
0

A kernel of a directed graph is a subset of vertices that is both independent and absorbing (every vertex not in the kernel has an out-neighbour in the kernel). Not all directed graphs contain kernels, and computing a kernel or deciding that none exist is NP-complete even on low-degree planar digraphs. The existing polynomial-time algorithms for this problem all restrict both the undirected structure and the edge orientations of the input: for example, to chordal graphs without bidirectional edges (Pass-Lanneau, Igarashi and Meunier, Discrete Appl Math 2020) or to permutation graphs where each clique has a sink (Abbas and Saoula, 4OR 2005). By contrast, we count the kernels of a fuzzy circular interval graph in polynomial time, regardless of its edge orientations, and return a kernel when one exists. (Fuzzy circular graphs were introduced by Chudnovsky and Seymour in their structure theorem for claw-free graphs.) We also consider kernels on cographs, where we establish NP-hardness in general but linear running times on the subclass of threshold graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2018

Perfect graphs with polynomially computable kernels

In a directed graph, a kernel is a subset of vertices that is both stabl...
research
04/20/2018

Planar Steiner Orientation is NP-complete

Many applications in graph theory are motivated by routing or flow probl...
research
11/09/2019

A Polynomial Kernel for Paw-Free Editing

For a fixed graph H, the H-free-editing problem asks whether we can modi...
research
07/07/2019

Complexity of planar signed graph homomorphisms to cycles

We study homomorphism problems of signed graphs. A signed graph is an un...
research
07/26/2021

On Kernels for d-Path Vertex Cover

In this paper we study the kernelization of d-Path Vertex Cover (d-PVC) ...
research
03/14/2023

Coloring and Recognizing Directed Interval Graphs

A mixed interval graph is an interval graph that has, for every pair of ...
research
02/08/2011

Graph Coalition Structure Generation

We give the first analysis of the computational complexity of coalition...

Please sign up or login with your details

Forgot password? Click here to reset