Fast subexponential algorithm for non-local problems on graphs of bounded genus

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

Volumn 4059 LNCS, Issue , 2006, Pages 172-183

  Dorn, Frederic ^a   Fomin, Fedor V ^a   Thilikos, Dimitrios M ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING;

BOUNDED GENUS; BRANCH DECOMPOSITIONS; PARAMETERIZED PROBLEMS; PLANARIZING TECHNIQUES;

GRAPH THEORY;

EID: 33746433091     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_18     Document Type: Conference Paper

References (15)

1. V. G. DEǏNEKO, B. KLINZ, AND G. J. WOEGINGER, Exact algorithms for the Hamiltonian cycle problem in planar graphs, Operations Research Letters, (2006), p. to appear.
2. E. D. DEMAINE, F. V. FOMIN, M. HAJIAGHAYI, AND D. M. THILIKOS, Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, Journal of the ACM, 52 (2005), pp. 866-893.
3. E. D. DEMAINE AND M. HAJIAGHAYI, Bidimensionality: new connections between FPT algorithms and PTASs, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), New York, 2005, ACM-SIAM, pp. 590-601.
4. F. DORN, F. V. FOMIN, AND D. M. THILIKOS, Fast subexponential algorithm for non-local problems on graphs of bounded genus, manuscript, (2006). http://www.ii.uib.no/publikasjoner/texrap/pdf/2006-320.pdf.
5. F. DORN, E. PENNINKX, H. BODLAENDER, AND F. V. FOMIN, Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions, in Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669 of LNCS, Springer, Berlin, 2005, pp. 95-106.
6. F. V. FOMIN AND D. M. THILIKOS, New upper bounds on the decomposability of planar graphs, Journal of Graph Theory, 51 (2006), pp. 53-81.
7. J. R. GILBERT, J. P. HUTCHINSON, AND R. E. TARJAN, A separator theorem for graphs of bounded genus, Journal of Algorithms, 5 (1984), pp. 391-407.
8. Q.-P. GU AND H. TAMAKI, Optimal branch-decomposition of planar graphs in O(n3) time, in Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), vol. 3580 of LNCS, Springer, Berlin, 2005, pp. 373-384.
9. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
10. _, Applications of a planar separator theorem, SIAM J. Comput., 9 (1980), pp. 615-627.
11. B. MOHAR AND C. THOMASSEN, Graphs on surfaces, Johns Hopkins Studies in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, MD, 2001.
12. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. VII. Disjoint paths on a surface, J. Combin. Theory Ser. B, 45 (1988), pp. 212-254.
13. P. D. SEYMOUR AND R. THOMAS, Call routing and the ratcatcher, Combinatorica, 14 (1994), pp. 217-241.
14. C. THOMASSEN, Embeddings of graphs with no short noncontractible cycles, J. Combin. Theory Ser. B, 48 (1990), pp. 155-177.
15. G. WOEGINGER, Exact algorithms for NP-hard problems: A survey, in Combinatorial Optimization - Eureka, you shrink!, vol. 2570 of LNCS, Springer-Verlag, Berlin, 2003, pp. 185-207.