Skip to main content
SpringerLink
Log in

Induced Packing of Odd Cycles in a Planar Graph

  • Conference paper
Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

Abstract

An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in time \(2^{{\cal O}(k^{3/2})} \cdot n^3 \log n\) when the input graph is planar. We also show that deciding if a graph has an induced packing of two odd cycles is NP-complete.

Supported by the project “Kapodistrias” (AΠ 02839/28.07.2008) of the National and Kapodistrian University of Athens (project code: 70/4/8757).

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Mathematics 90(1), 85–92 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth lower bounds with brambles. Algorithmica 51, 81–98 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms 48, 239–256 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Conforti, M., Cornuéjols, G., Liu, X., Vuskovic, K., Zambelli, G.: Odd hole recognition in graphs of bounded clique size. SIAM J. Discrete Math. 20, 42–48 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85, 12–75 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. Diestel, R.: Graph Theory, Electronic Edition. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  7. Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comp. Sci. Rev. 2, 29–39 (2008)

    Article  Google Scholar 

  8. Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95–106. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449–467 (1965)

    MATH  MathSciNet  Google Scholar 

  10. Friggstad, Z., Salavatipour, M.R.: Approximability of packing disjoint cycles, pp. 304–315 (2007)

    Google Scholar 

  11. Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co., San Francisco (1979); A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences

    MATH  Google Scholar 

  12. Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics 154, 971–979 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hassin, R., Rubinstein, S.: Erratum to an approximation algorithm for maximum triangle packing. Discrete applied mathematics 154, 971–979 (2006); Discrete Applied Mathematics 154, 2620 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. Krivelevich, M., Nutov, Z., Salavatipour, M.R., Yuster, J., Yuster, R.: Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms 3 (2007)

    Google Scholar 

  15. Conforti, A.K.M., Cornuéjols, G., Vušković, K.: Part i: Decomposition theorem. J. Graph Theory 39, 6–49 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Conforti, A.K.M., Cornuéjols, G., Vušković, K.: Part ii: Recognition algorithm. J. Graph Theory 40, 238–266 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Maria Chudnovsky, P.S., Kawarabayashi, K.-i.: Detecting even holes. J. Graph Theory 48, 85–111 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Reed, B.A.: Mangoes and blueberries. Combinatorica 19, 267–296 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62, 323–348 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Sau, I., Thilikos, D.M.: Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. Electronic Notes in Discrete Mathematics 32, 59–66 (2009)

    Article  Google Scholar 

  21. Yap, H.P.: Packing of graphs - a survey. Discrete Mathematics 72, 395–404 (1988)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bergen,  

    Petr A. Golovach

  2. Department of Computer Science, Université Libre de Bruxelles,  

    Marcin Kamiński

  3. Department of Computer Science, University of Durham,  

    Daniël Paulusma

  4. Department of Mathematics, National and Kapodistrian University of Athens,  

    Dimitrios M. Thilikos

Authors
  1. Petr A. Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Kamiński
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniël Paulusma
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dimitrios M. Thilikos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golovach, P.A., Kamiński, M., Paulusma, D., Thilikos, D.M. (2009). Induced Packing of Odd Cycles in a Planar Graph. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_53

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

  • Online ISBN: 978-3-642-10631-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation