Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds

04/24/2020
by   Fedor V. Fomin, et al.
0

We prove that the Hadwiger number of an n-vertex graph G (the maximum size of a clique minor in G) cannot be computed in time n^o(n), unless the Exponential Time Hypothesis (ETH) fails. This resolves a well-known open question in the area of exact exponential algorithms. The technique developed for resolving the Hadwiger number problem has a wider applicability. We use it to rule out the existence of n^o(n)-time algorithms (up to ETH) for a large class of computational problems concerning edge contractions in graphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/19/2020

Tight Bounds on The Clique Chromatic Number

The clique chromatic number of a graph is the minimum number of colours ...
10/07/2018

Counting homomorphisms in plain exponential time

In the counting Graph Homomorphism problem (#GraphHom) the question is: ...
08/11/2017

New Tools and Connections for Exponential-time Approximation

In this paper, we develop new tools and connections for exponential time...
05/04/2018

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods

We consider the problem of computing the size of each r-neighbourhood fo...
02/17/2022

Using Edge Contractions and Vertex Deletions to Reduce the Independence Number and the Clique Number

We consider the following problem: for a given graph G and two integers ...
12/17/2020

Clique Is Hard on Average for Regular Resolution

We prove that for k ≪√(n) regular resolution requires length n^Ω(k) to e...
06/20/2020

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

We address counting and optimization variants of multicriteria global mi...
This week in AI

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