Abstract
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafting and Orthogonal Vector crafting, and show that these cannot be solved in time \(2^{o(|s|/\log {|s|})}\), unless the Exponential Time Hypothesis fails.
These results are used to obtain simplified hardness results for several graph embedding problems, on more restricted graph classes than previously known: assuming the Exponential Time Hypothesis, there do not exist algorithms that run in \(2^{o(n/\log n)}\) time for Subgraph Isomorphism on graphs of pathwidth 1, Induced Subgraph Isomorphism on graphs of pathwidth 1, Graph Minor on graphs of pathwidth 1, Induced Graph Minor on graphs of pathwidth 1, Intervalizing 5-Colored Graphs on trees, and finding a tree or path decomposition with width at most c with a minimum number of bags, for any fixed \(c\ge 16\).
\(2^{\varTheta (n/\log n)}\) appears to be the “correct” running time for many packing and embedding problems on restricted graph classes, and we think String Crafting and Orthogonal Vector Crafting form a useful framework for establishing lower bounds of this form.
H.L. Bodlaender—The research of this author was partially supported by the NETWORKS project, funded by the Netherlands Organization for Scientific Research NWO.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Marx, D.: The square root phenomenon in planar graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM/FAW -2013. LNCS, vol. 7924, p. 1. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38756-2_1
Marx, D.: What’s next? Future directions in parameterized complexity. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 469–496. Springer, Heidelberg (2012). doi:10.1007/978-3-642-30891-8_20
Bodlaender, H.L., Nederlof, J., van der Zanden, T.C.: Subexponential time algorithms for embedding \(H\)-minor free graphs. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), vol. 55, Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, pp. 9: 1–9: 14 (2016)
Bodlaender, H.L., van Rooij, J.M.M.: Exact algorithms for Intervalizing Coloured Graphs. Theor. Comput. Syst. 58(2), 273–286 (2016)
Bodlaender, H.L., Nederlof, J.: Subexponential time algorithms for finding small tree and path decompositions. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 179–190. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48350-3_16
Bodlaender, H.L., van der Zanden, T.C.: Improved lower bounds for graph embedding problems. arXiv preprint (2016). arXiv:1610.09130
Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512–530 (2001)
Àlvarez, C., Diáz, J., Serna, M.: The hardness of intervalizing four colored caterpillars. Discret. Math. 235(1), 19–27 (2001)
Jansen, K., Land, F., Land, K.: Bounding the running time of algorithms for scheduling and packing problems. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 439–450. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40104-6_38
Bodlaender, H.L., de Fluiter, B.: Intervalizing \(k\)-colored graphs. Technical report UU-CS-1995-15, Department of Information and Computing Sciences, Utrecht University (1995)
Bodlaender, H.L., de Fluiter, B.: On intervalizing \(k\)-colored graphs for DNA physical mapping. Discret. Appl. Math. 71(1), 55–77 (1996)
Kaplan, H., Shamir, R.: Bounded degree interval sandwich problems. Algorithmica 24(2), 96–104 (1999)
Acknowledgement
We thank Jesper Nederlof for helpful comments and discussions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bodlaender, H.L., van der Zanden, T.C. (2017). Improved Lower Bounds for Graph Embedding Problems. In: Fotakis, D., Pagourtzis, A., Paschos, V. (eds) Algorithms and Complexity. CIAC 2017. Lecture Notes in Computer Science(), vol 10236. Springer, Cham. https://doi.org/10.1007/978-3-319-57586-5_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-57586-5_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57585-8
Online ISBN: 978-3-319-57586-5
eBook Packages: Computer ScienceComputer Science (R0)