Dynamic programming for graphs on surfaces

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 372-383

  Rué, Juanjo ^a   Sau, Ignasi ^b   Thilikos, Dimitrios M ^c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

analysis of algorithms; analytic combinatorics; branchwidth; dynamic programming; graphs on surfaces; non crossing partitions; parameterized algorithms; polyhedral embeddings; symbolic method

Indexed keywords

ANALYSIS OF ALGORITHMS; ANALYTIC COMBINATORICS; BRANCHWIDTH; EMBEDDINGS; PARAMETERIZED ALGORITHM; SYMBOLIC METHODS;

ALGORITHMS; DYNAMIC ANALYSIS; GRAPH THEORY; GRAPHIC METHODS; LINGUISTICS; TRANSLATION (LANGUAGES);

DYNAMIC PROGRAMMING;

EID: 77955314466     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_32     Document Type: Conference Paper

References (20)

1. Adler, I., Dorn, F., Fomin, F. V., Sau, I., Thilikos, D. M.: Faster Parameterized Algorithms for Minor Containment. In: Proc. of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT) (to appear, 2010)
2. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Proc. of the 17th Conf. on Uncertainty in Artificial Intelligence (UAI), pp. 7-15 (2001)
3. Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT 25 (1), 2-23 (1985)
4. Bodlaender, H. L.: Dynamic programming on graphs with bounded treewidth. In: Lepistö, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 105-118. Springer, Heidelberg (1988)
5. Cabello, S., Mohar, B.: Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Discrete and Computational Geometry 37, 213-235 (2007)
6. Courcelle, B.: The monadic second-order logic of graphs: definable sets of finite graphs. In: van Leeuwen, J. (ed.) WG 1988. LNCS, vol. 344, pp. 30-53. Springer, Heidelberg (1989)
7. Demaine, E. D., Fomin, F. V., Hajiaghayi, M. T., Thilikos, D. M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of the ACM 52 (6), 866-893 (2005)
8. Demaine, E. D., Hajiaghayi, M., Thilikos, D. M.: The Bidimensional Theory of Bounded-Genus Graphs. SIAM Journal on Discrete Mathematics 20 (2), 357-371 (2006)
9. Dorn, F., Fomin, F. V., Thilikos, D. M.: Fast Subexponential Algorithm for Nonlocal Problems on Graphs of Bounded Genus. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol. 4059, pp. 172-183. Springer, Heidelberg (2006)
10. Dorn, F., Fomin, F. V., Thilikos, D. M.: Subexponential parameterized algorithms. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 15-27. Springer, Heidelberg (2007)
11. Dorn, F., Fomin, F. V., Thilikos, D. M.: Catalan structures and dynamic programming in H-minor-free graphs. In: Proc. of the 19th annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 631-640 (2008)
12. 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)
13. Flajolet, F., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2008)
14. Flajolet, P., Noy, M.: Analytic combinatorics of non-crossing configurations. Discrete Mathematics 204 (1), 203-229 (1999)
15. Fomin, F. V., Thilikos, D. M.: Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 581-592. Springer, Heidelberg (2004)
16. Mohar, B., Thomassen, C.: Graphs on surfaces. John Hopk. Univ. Press, Baltimore (2001)
17. Robertson, N., Seymour, P.: Graph minors. XII. Distance on a surface. J. Combin. Theory Series B 64, 240-272 (1995)
18. Rué, J., Sau, I., Thilikos, D. M.: Dynamic Programming for Graphs on Surfaces. Research Report RR-7166, INRIA (2009), hal.archives-ouvertes.fr/ inria-00443582
19. Seymour, P., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14 (2), 217-241 (1994)
20. Telle, J. A., Proskurowski, A.: Algorithms for vertex partitioning problems on partial κ-trees. SIAM Journal on Discrete Mathematics 10 (4), 529-550 (1997)