Induced packing of odd cycles in a planar graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5878 LNCS, Issue , 2009, Pages 514-523

  Golovach, Petr A ^a   Kamiński, Marcin ^b   Paulusma, Daniël ^c   Thilikos, Dimitrios M ^d  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c DURHAM UNIVERSITY   (United Kingdom)

^d UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

INDUCED PACKINGS; INPUT GRAPHS; NP COMPLETE; ODD CYCLE; PLANAR GRAPH;

GRAPH THEORY;

EID: 75649124545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_53     Document Type: Conference Paper

References (22)

1. Bienstock, D.: On the complexity of testing for odd holes and induced odd paths. Discrete Mathematics 90(1), 85-92 (1991)
2. Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth lower bounds with brambles. Algorithmica 51, 81-98 (2008)
3. Caprara, A., Panconesi, A., Rizzi, R.: Packing cycles in undirected graphs. J. Algorithms 48, 239-256 (2003)
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)
5. Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput. 85, 12-75 (1990)
6. Diestel, R.: Graph Theory, Electronic Edition. Springer, Heidelberg (2005)
7. Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Comp. Sci. Rev. 2, 29-39 (2008)
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)
9. Edmonds, J.: Paths, trees and flowers. Canadian Journal of Mathematics 17, 449-467 (1965)
10. Friggstad, Z., Salavatipour, M.R.: Approximability of packing disjoint cycles, pp. 304-315 (2007)
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
12. Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Applied Mathematics 154, 971-979 (2006)
13. Hassin, R., Rubinstein, S.: Erratum to an approximation algorithm for maximum triangle packing. Discrete applied mathematics 154, 971-979 (2006);
14. Discrete Applied Mathematics 154, 2620 (2006)
15. 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)
16. Conforti, A.K.M., Cornuéjols, G., Vušković, K.: Part i: Decomposition theorem. J. Graph Theory 39, 6-49 (2002)
17. Conforti, A.K.M., Cornuéjols, G., Vušković, K.: Part ii: Recognition algorithm. J. Graph Theory 40, 238-266 (2002)
18. Maria Chudnovsky, P.S., Kawarabayashi, K.-i.: Detecting even holes. J. Graph Theory 48, 85-111 (2005)
19. Reed, B.A.: Mangoes and blueberries. Combinatorica 19, 267-296 (1999)
20. Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62, 323-348 (1994)
21. 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)
22. Yap, H.P.: Packing of graphs - a survey. Discrete Mathematics 72, 395-404 (1988)