Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space

A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivity problems parameterized by treewidth can be solved much faster than the previously best known time ?^*(2^{?(twlog tw)}). Using their inspired Cut&Count technique, they obtained ?^*(?^tw) time algorithms for many such problems. Moreover, they proved these running times to be optimal assuming the Strong Exponential-Time Hypothesis. Unfortunately, like other dynamic programming algorithms on tree decompositions, these algorithms also require exponential space, and this is widely believed to be unavoidable. In contrast, for the slightly larger parameter called treedepth, there are already several examples of matching the time bounds obtained for treewidth, but using only polynomial space. Nevertheless, this has remained open for connectivity problems. In the present work, we close this knowledge gap by applying the Cut&Count technique to graphs of small treedepth. While the general idea is unchanged, we have to design novel procedures for counting consistently cut solution candidates using only polynomial space. Concretely, we obtain time ?^*(3^d) and polynomial space for Connected Vertex Cover, Feedback Vertex Set, and Steiner Tree on graphs of treedepth d. Similarly, we obtain time ?^*(4^d) and polynomial space for Connected Dominating Set and Connected Odd Cycle Transversal

Comments on worldsheet theories dual to free large N gauge theories

We continue to investigate properties of the worldsheet conformal field theories (CFTs) which are conjectured to be dual to free large N gauge theories, using the mapping of Feynman diagrams to the worldsheet suggested in hep-th/0504229. The modular invariance of these CFTs is shown to be built into the formalism. We show that correlation functions in these CFTs which are localized on subspaces of the moduli space may be interpreted as delta-function distributions, and that this can be consistent with a local worldsheet description given some constraints on the operator product expansion coefficients. We illustrate these features by a detailed analysis of a specific four-point function diagram. To reliably compute this correlator we use a novel perturbation scheme which involves an expansion in the large dimension of some operators.Comment: 43 pages, 16 figures, JHEP format. v2: added reference

Gaps in the Saturation Spectrum of Trees

A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n, H), while the maximum size is the well studied extremal number, ex(n, H). The saturation spectrum for a graph H is the set of sizes of H-saturated graphs between sat(n, H) and ex(n, H). In this paper we show that paths, trees with a vertex adjacent to many leaves, and brooms have a gap in the saturation spectrum