Feb 16, 2016 · We prove that unless the Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time.

For both problems our lower bounds asymptotically match the running time of brute-force algorithms trying all possible mappings of one graph into another. Thus, ...

Tight Lower Bounds on Graph Embedding Problems · Marek Cygan, F. Fomin, +4 authors. Arkadiusz Socala · Published in Journal of the ACM 16 February 2016 ...

In Section 3 we give technical lemmata and reductions that are used to prove lower bounds for the GRAPH HOMOMORPHISM problem in Section 4.1 and for the SUBGRAPH ...

Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some mea- sure. Often this measure is some ...

Oct 28, 2016 · In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial ...

We give an algorithmic and lower bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds.

Jul 14, 2021 · We prove essentially tight lower bounds, conditionally to the Exponential Time Hypothesis, for two fundamental but seemingly very different cutting problems on ...

It is also known that this bound is tight since there are expander graphs which cannot be embedded into distributions over trees with better than Ω(log n) ...

Apr 26, 2022 · Bibliographic details on Tight Lower Bounds on Graph Embedding Problems.