The Smallest Hard Trees

05/16/2022
by   Manuel Bodirsky, et al.
0

We find an orientation of a tree with 20 vertices such that the corresponding fixed-template constraint satisfaction problem (CSP) is NP-complete, and prove that for every orientation of a tree with fewer vertices the corresponding CSP can be solved in polynomial time. We also compute the smallest tree that is NL-hard (assuming L is not NL), the smallest tree that cannot be solved by arc consistency, and the smallest tree that cannot be solved by Datalog. Our experimental results also support a conjecture of Bulin concerning a question of Hell, Nesetril and Zhu, namely that "easy trees lack the ability to count". Most proofs are computer-based and make use of the most recent universal-algebraic theory about the complexity of finite-domain CSPs. However, further ideas are required because of the huge number of orientations of trees. In particular, we use the well-known fact that it suffices to study orientations of trees that are cores and show how to efficiently decide whether a given orientation of a tree is a core using the arc-consistency procedure. Moreover, we present a method to generate orientations of trees that are cores that works well in practice. In this way we found interesting examples for the open research problem to classify finite-domain CSPs in NL.

READ FULL TEXT
research
11/04/2022

Steiner connectivity problems in hypergraphs

We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a hypergraph i...
research
08/30/2022

Simpler and efficient characterizations of tree t-spanners for graphs with few P4's and (k, l)-graphs

A tree t-spanner of a graph G is a spanning tree T in which the distance...
research
12/12/2017

On the existence of a cherry-picking sequence

Recently, the minimum number of reticulation events that is required to ...
research
04/11/2018

Weighted proper orientations of trees and graphs of bounded treewidth

Given a simple graph G, a weight function w:E(G)→N∖{0}, and an orientati...
research
04/25/2023

Network Satisfaction Problems Solved by k-Consistency

We show that the problem of deciding for a given finite relation algebra...
research
07/22/2023

Agreement forests of caterpillar trees: complexity, kernelization and branching

Given a set X of species, a phylogenetic tree is an unrooted binary tree...
research
04/12/2019

Dominator Chromatic Numbers of Orientations of Trees

In this paper we prove that the dominator chromatic number of every orie...

Please sign up or login with your details

Forgot password? Click here to reset