Abstract
Let n be the size of a parameterized problem and k the parameter. We present kernels for Feedback Vertex Set and Path Contraction whose sizes are all polynomial in k and that are computable in polynomial time and with \(O({{\,\textrm{poly}\,}}(k) \log n)\) bits (of working memory). By using kernel cascades, we obtain the best known kernels in polynomial time with \(O({{\,\textrm{poly}\,}}(k) \log n)\) bits.
Funded by the DFG – 379157101; A full version can be found in [17].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bannach, M., Stockhusen, C., Tantau, T.: Fast parallel fixed-parameter algorithms via color coding. In: Proceedings of the 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). LIPIcs, vol. 43, pp. 224–235. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015). https://doi.org/10.4230/LIPIcs.IPEC.2015.224
Becker, A., Geiger, D.: Approximation algorithms for the loop cutset problem. In: Proceedings of the 10th Annual Conference on Uncertainty in Artificial Intelligence (UAI 1994), pp. 60–68. Morgan Kaufmann (1994)
Biswas, A., Raman, V., Satti, S.R., Saurabh, S.: Space-efficient FPT algorithms. CoRR, abs/2112.15233 (2021). ar**v:2112.15233
Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: Advice classes of parameterized tractability. Ann. Pure Appl. Log. 84(1), 119–138 (1997). https://doi.org/10.1016/S0168-0072(95)00020-8
Chakraborty, S., Sadakane, K., Satti, S.R.: Optimal in-place algorithms for basic graph problems. In: Gąsieniec, L., Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 126–139. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-48966-3_10
Chen, J., Fomin, F.V., Liu, Y., Songjian, L., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188–1198 (2008). https://doi.org/10.1016/j.jcss.2008.05.002
Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8(3), 385–394 (1987). https://doi.org/10.1016/0196-6774(87)90018-6
Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Damaschke, P.: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction. Theor. Comput. Sci. 351(3), 337–350 (2006). https://doi.org/10.1016/j.tcs.2005.10.004
Datta, S., Kulkarni, R., Mukherjee, A.: Space-efficient approximation scheme for maximum matching in sparse graphs. In: Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). LIPIcs, vol. 58, pp. 28:1–28:12. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016). https://doi.org/10.4230/LIPIcs.MFCS.2016.28
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science, Springer, Cham (1999). https://doi.org/10.1007/978-1-4612-0515-9
Elberfeld, M., Stockhusen, C., Tantau, T.: On the space and circuit complexity of parameterized problems: classes and completeness. Algorithmica 71(3), 661–701 (2015). https://doi.org/10.1007/s00453-014-9944-y
Fafianie, S., Kratsch, S.: A shortcut to (sun)flowers: kernels in logarithmic space or linear time. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9235, pp. 299–310. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48054-0_25
Heeger, K., Himmel, A.-S., Kammer, F., Niedermeier, R., Renken, M., Sajenko, A.: Multistage graph problems on a global budget. Theor. Comput. Sci. 868, 46–64 (2021). https://doi.org/10.1016/j.tcs.2021.04.002
Iwata, Y.: Linear-time kernelization for feedback vertex set. In: Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, (ICALP 2017). LIPIcs, vol. 80, pp. 68:1–68:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017). https://doi.org/10.4230/LIPIcs.ICALP.2017.68
Izumi, T., Otachi, Y.: Sublinear-space lexicographic depth-first search for bounded treewidth graphs and planar graphs. In: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, (ICALP 2020). LIPIcs, vol. 168, pp. 67:1–67:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPICS.ICALP.2020.67
Kammer, F., Sajenko, A.: Space-efficient graph kernelizations. CoRR, abs/2007.11643 (2020). ar**v:2007.11643
Li, W., Feng, Q., Chen, J., Shuai, H.: Improved kernel results for some FPT problems based on simple observations. Theor. Comput. Sci. 657, 20–27 (2017). https://doi.org/10.1016/j.tcs.2016.06.012
Thomassé, S.: A 4k\({}^{\text{2}}\) kernel for feedback vertex set. ACM Trans. Algorithms, 6(2), 32:1–32:8 (2010). https://doi.org/10.1145/1721837.1721848
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kammer, F., Sajenko, A. (2024). Space-Efficient Graph Kernelizations. In: Chen, X., Li, B. (eds) Theory and Applications of Models of Computation. TAMC 2024. Lecture Notes in Computer Science, vol 14637. Springer, Singapore. https://doi.org/10.1007/978-981-97-2340-9_22
Download citation
DOI: https://doi.org/10.1007/978-981-97-2340-9_22
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-2339-3
Online ISBN: 978-981-97-2340-9
eBook Packages: Computer ScienceComputer Science (R0)