Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs

Journal of Discrete Algorithms

Volumn 8, Issue 3, 2010, Pages 330-338

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

^a INRIA   (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

BIDIMENSIONALITY; BRANCH DECOMPOSITION; CATALAN STRUCTURES; GRAPH MINORS; PARAMETERIZED COMPLEXITY; PLANAR GRAPH; SUB-EXPONENTIAL ALGORITHMS;

ALGORITHMS; DYNAMIC PROGRAMMING; GRAPHIC METHODS; PARAMETERIZATION;

GRAPH THEORY;

EID: 77955714305     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2010.02.002     Document Type: Article

References (20)

1. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh Degree-constrained subgraph problems: Hardness and approximation Proc. of the 6th Workshop on Approximation and On-line Algorithms (WAOA) LNCS vol. 5426 2008 29 42
2. P.A. Catlin Supereulerian graphs: a survey Journal of Graph Theory 16 2 1992 177 196
3. E.D. Demaine, F.V. Fomin, M.T. Hajiaghayi, and D.M. Thilikos Subexponential parameterized algorithms on graphs of bounded genus and h-minor-free graphs Journal of the ACM 52 6 2005 866 893
4. F. Dorn, F.V. Fomin, and D.M. Thilikos Subexponential parameterized algorithms Proc. of the 34th International Colloquium on Automata, Languages and Programming (ICALP) LNCS vol. 4596 2007 15 27
5. F. Dorn, F.V. Fomin, D.M. Thilikos, Catalan structures and dynamic programming in H-minor-free graphs, in: Proc. of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2008, pp. 631-640
6. F. Dorn, E. Penninkx, H.L. Bodlaender, and F.V. Fomin Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions Proc. of the 13th Annual European Symposium on Algorithms (ESA) LNCS vol. 3669 2005 95 106
7. F. Dorn, and J.A. Telle Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm Discrete Applied Mathematics 157 12 2009 2737 2746
8. P. Flajolet, and R. Sedgewick Analytic Combinatorics 2008 Cambridge University Press
9. J. Flum, and M. Grohe Parameterized Complexity Theory 2006 Springer Verlag
10. F.V. Fomin, and D.M. Thilikos New upper bounds on the decomposability of planar graphs Journal of Graph Theory 51 1 2005 53 81
11. F.V. Fomin, and D.M. Thilikos Dominating sets in planar graphs: Branch-width and exponential speed-up SIAM Journal on Computing 36 2 2006 281 309
12. M. Fürer, B. Raghavachari, Approximating the minimum-degree spanning tree to within one from the optimal degree, in: Proc. of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1992, pp. 317-324
13. M. Garey, and D. Johnson Computers and Intractability 1979 W.H. Freeman
14. Q.-P. Gu, and H. Tamaki Optimal branch-decomposition of planar graphs in O (n 3 ) time ACM Transactions on Algorithms 4 3 2008
15. Q.-P. Gu, and H. Tamaki Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O (n 1 + ) time Proc. of the 20th International Symposium Algorithms and Computation (ISAAC) LNCS vol. 5878 2009 984 993
16. G. Kreweras Sur les partitions non croisées d'un cercle Discrete Mathematics 1 1972 333 350
17. L. Lovász, and M. Plummer Matching Theory Annals of Discr. Math. vol. 29 1986 North-Holland Amsterdam
18. N. Robertson, and P. Seymour Graph minors. X. Obstructions to tree-decomposition J. Comb. Theory, Ser. B 52 2 1991 153 190
19. N. Robertson, P. Seymour, and R. Thomas Quickly excluding a planar graph J. Comb. Theory, Ser. B 62 2 1994 323 348
20. P. Seymour, and R. Thomas Call routing and the ratcatcher Combinatorica 14 2 1994 217 241