Abstract
We consider the problem of finding a k-edge transversal set that intersects all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, referred to as Small Cycle Transversal, is known to be NP-complete. We present a polynomial-time algorithm that computes a kernel of size 36 s 3 k for Small Cycle Transversal. In order to achieve this kernel, we extend the region decomposition technique of Alber et al. [J. ACM, 2004 ] by considering a unique region decomposition that is defined by shortest paths. Our kernel size is an exponential improvement in terms of s over the kernel size obtained under the meta-kernelization framework by Bodlaender et al. [FOCS, 2009 ].
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
Preview
Unable to display preview. Download preview PDF.
References
Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363–384 (2004)
Alon, N., Bollobás, B., Krivelevich, M., Sudakov, B.: Maximum cuts and judicious partitions in graphs without short cycles. J. Comb. Theory Ser. B 88(2), 329–346 (2003)
Bley, A., Grötschel, M., Wessly, R.: Design of broadband virtual private networks: Model and heuristics for the B-WiN. In: Robust Communication Networks: Interconnection and Survivability. DIMACS Series, vol. 53, pp. 1–16. AMS, Providence (1998)
Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) kernelization. In: FOCS CoRR, abs/0904.0727 (2009)
Brügmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electronic Notes in Discrete Mathematics 32, 51–58 (2009)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31–45 (2007)
Guo, J., Niedermeier, R.: Linear problem kernels for NP-hard problems on planar graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 375–386. Springer, Heidelberg (2007)
Hoory, S.: The size of bipartite graphs with a given girth. J. Comb. Theory Ser. B 86(2), 215–220 (2002)
Kortsarz, G., Langberg, M., Nutov, Z.: Approximating maximum subgraphs without short cycles. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 118–131. Springer, Heidelberg (2008)
Krasikov, I., Noble, S.D.: Finding next-to-shortest paths in a graph. Inf. Process. Lett. 92(3), 117–119 (2004)
Pevzner, P., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. Genome Research 14(9), 1786–1796 (2004)
Raman, V., Saurabh, S.: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles. Algorithmica 52(2), 203–225 (2008)
Timmons, C.: Star coloring high girth planar graphs. The Electronic Journal of Combinatorics 15(R124) (2008)
Xia, G., Zhang, Y.: On the small cycle transversal of planar graphs. Technical Report, http://www.cs.lafayette.edu/~gexia/research/sctrans.pdf
Xia, G., Zhang, Y.: Kernelization for cycle transversal problems. In: AAIM, pp. 293–303 (2010)
Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC 1978, pp. 253–264 (1978)
Zhu, J., Bu, Y.: Equitable list colorings of planar graphs without short cycles. Theor. Comput. Sci. 407(1-3), 21–28 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, G., Zhang, Y. (2010). On the Small Cycle Transversal of Planar Graphs. In: Thilikos, D.M. (eds) Graph Theoretic Concepts in Computer Science. WG 2010. Lecture Notes in Computer Science, vol 6410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16926-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-16926-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16925-0
Online ISBN: 978-3-642-16926-7
eBook Packages: Computer ScienceComputer Science (R0)