Skip to main content
SpringerLink
Log in

Obtaining Split Graphs by Edge Contraction

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8546))

Included in the following conference series:

  • 765 Accesses

Abstract

We study the parameterized complexity of the following Split Contraction problem: Given a graph G and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction can be solved in FPT time \(2^{O(k^2)}n^5\), but admits no polynomial kernel unless NP ⊆ coNP/poly.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belmonte, R., Golovach, P.A., van ’t Hof, P., Paulusma, D.: Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 16–27. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. Journal of Computer and System Sciences 75(8), 423–434 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  3. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58, 171–176 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Cai, L., Guo, C.: Contracting few edges to remove forbidden induced subgraphs. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 97–109. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Cao, Y., Marx, D.: Interval deletion is fixed-parameter tractable. In: Chekuri, C. (ed.) SODA 2014, pp. 122–141. SIAM (2014)

    Google Scholar 

  6. Chen, J., Meng, J.: A 2k kernel for the cluster editing problem. Journal of Computer and System Sciences 78(1), 211–220 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cygan, M., Pilipczuk, M.: On fixed-parameter algorithms for split vertex deletion. arXiv:1208.1248 (2012)

    Google Scholar 

  8. Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and iDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Ghosh, E., Kolay, S., Kumar, M., Misra, P., Panolan, F., Rai, A., Ramanujan, M.S.: Faster parameterized algorithms for deletion to split graphs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 107–118. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Golovach, P.A., Kamiński, M., Paulusma, D., Thilikos, D.M.: Increasing the minimum degree of a graph by contractions. Theoretical Computer Science 481, 74–84 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Golovach, P.A., van’t Hof, P., Paulusma, D.: Obtaining planarity by contracting few edges. Theoretical Computer Science 476, 38–46 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  12. Guillemot, S., Marx, D.: A faster FPT algorithm for bipartite contraction. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 177–188. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  13. Guo, J.: Problem kernels for NP-complete edge deletion problems: Split and related graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 915–926. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Heggernes, P., van ’t Hof, P., Lévêque, B., Lokshtanov, D., Paul, C.: Contracting graphs to paths and trees. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 55–66. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  15. Heggernes, P., van’t Hof, P., Lokshtanov, D., Paul, C.: Obtaining a bipartite graph by contracting few edges. In: Supratik, C., Amit, K. (eds.) FSTTCS 2011. LIPIcs, vol. 13, pp. 217–228. Schloss Dagstuhl, Leibniz-Zentrum für Informatik (2011)

    Google Scholar 

  16. Lin, G.-H., Kearney, P.E., Jiang, T.: Phylogenetic k-root and steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 539–551. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Lokshtanov, D., Misra, N., Saurabh, S.: On the hardness of eliminating small induced subgraphs by contracting edges. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 243–254. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong S.A.R., China

    Chengwei Guo & Leizhen Cai

Authors
  1. Chengwei Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leizhen Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, BC, Canada

    Qianping Gu  & Pavol Hell  & 

  2. Department of Computer Science, University of Regina, S4S 0A2, Regina, SK, Canada

    Boting Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Guo, C., Cai, L. (2014). Obtaining Split Graphs by Edge Contraction. In: Gu, Q., Hell, P., Yang, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2014. Lecture Notes in Computer Science, vol 8546. Springer, Cham. https://doi.org/10.1007/978-3-319-07956-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07956-1_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07955-4

  • Online ISBN: 978-3-319-07956-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation