DeepAI
Log In Sign Up

QCSP on Reflexive Tournaments

04/21/2021
by   Benoit Larose, et al.
0

We give a complexity dichotomy for the Quantified Constraint Satisfaction Problem QCSP(H) when H is a reflexive tournament. It is well-known that reflexive tournaments can be split into a sequence of strongly connected components H_1,...,H_n so that there exists an edge from every vertex of H_i to every vertex of H_j if and only if i<j. We prove that if H has both its initial and final strongly connected component (possibly equal) of size 1, then QCSP(H) is in NL and otherwise QCSP(H) is NP-hard.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/26/2019

Twinless articulation points and some related problems

Let G=(V,E) be a twinless strongly connected graph. a vertex v∈ V is a t...
01/29/2021

Counting orientations of graphs with no strongly connected tournaments

Let S_k(n) be the maximum number of orientations of an n-vertex graph G ...
12/14/2021

A note on 2-vertex-connected orientations

We consider two possible extensions of a theorem of Thomassen characteri...
07/13/2020

Strengthening neighbourhood substitution

Domain reduction is an essential tool for solving the constraint satisfa...
08/19/2019

Safe sets in digraphs

A non-empty subset S of the vertices of a digraph D is called a safe se...
05/29/2020

Parameterized Complexity of Min-Power Asymmetric Connectivity

We investigate parameterized algorithms for the NP-hard problem Min-Powe...
04/10/2020

The giant component of the directed configuration model revisited

We prove a law of large numbers for the order and size of the largest st...