The vertex integrity of a graph $G$ is the minimum of $|S|+\max_{C\in\operatorname{cc}(G-S)}|V(C)|$ over all vertex sets $S\subseteq V(G)$, where the maximum is zero if $G-S$ is empty. We study its exact exponential complexity in terms of $n=|V(G)|$. First, we give a reduction from Vertex Cover on subcubic graphs that increases the number of vertices by only a constant factor. Consequently, unless the Exponential Time Hypothesis fails, Vertex Integrity admits no $2^{o(n)}n^{O(1)}$-time algorithm. We also give a deterministic exact algorithm running in $O(1.9602^n)$ time and space, improving on the direct $O^*(2^n)$ algorithm. Its key ingredients are a balanced partition of the components left by an optimal irredundant separator and a subset dynamic program restricted to sets of at most $\lceil 2n/5\rceil$ vertices. An optimal separator can be recovered within the same bounds.

翻译：暂无翻译