Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs

Electronic Notes in Discrete Mathematics

Volumn 32, Issue C, 2009, Pages 59-66

  Sau, Ignasi ^a,b   Thilikos, Dimitrios M ^c  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

bidimensionality; branch decomposition; Catalan structures; graph minors; Parameterized complexity; planar graphs; subexponential algorithm

Indexed keywords

EID: 61549132311     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2009.02.009     Document Type: Article

References (15)

1. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. Degree-Constrained Subgraph Problems: Hardness and Approximation. In Workshop on Approximation and On-line Algorithms (ALGO/WAOA), 2008
2. Demaine E.D., Fomin F.V., Hajiaghayi M.T., and Thilikos D.M. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of the ACM 52 6 (2005) 866-893
3. Dorn F., Fomin F.V., and Thilikos D.M. Subexponential parameterized algorithms. Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP) (2007) 15-27
4. Dorn F., Fomin F.V., and Thilikos D.M. Catalan structures and dynamic programming in H-minor-free graphs. Proceedings of the 19th annual ACM-SIAM Symposium on Discrete algorithms (SODA) (2008) 631-640
5. Dorn F., Penninkx E., Bodlaender H.L., and Fomin F.V. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. Proceedings of the 13th Annual European Symposium on Algorithms (ESA) (2005) 95-106
6. Flajolet P., and Sedgewick R. Analytic Combinatorics (2008), Cambridge University Press
7. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer Verlag
8. Fomin F.V., and Thilikos D.M. New upper bounds on the decomposability of planar graphs. Journal of Graph Theory 51 1 (2005) 53-81
9. Garey M., and Johnson D. Computers and Intractability (1979), W.H. Freeman
10. 3) time. ACM Transactions on Algorithms 4 3 (2008)
11. Kreweras G. Sur les partitions non croisées d'un cercle. Discrete Mathematics 1 (1972) 333-350
12. Lovász L., and Plummer M. Matching Theory. Annals of Discr. Math 29 (1986)
13. Robertson N., Seymour P., and Thomas R. Quickly excluding a planar graph. J. Comb. Theory Ser. B 62 2 (1994) 323-348
14. Sau I., and Thilikos D.M. Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs. Manuscript accessible at (2009). http://www.thilikos.info/papers/maxedge.pdf
15. Seymour P., and Thomas R. Call routing and the ratcatcher. Combinatorica 14 2 (1994) 217-241