Dynamic programming for graphs on surfaces
Document typeConference report
Rights accessOpen Access
European Commisision's projectEXPLOREMAPS - Combinatorial methods, from enumerative topology to random discrete structures and compact data representations. (EC-FP7-208471)
We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2O(k·log k). Our approach combines tools from topological graph theory and analytic combinatorics.
CitationRue, J., Sau, I., Thilikos, D. Dynamic programming for graphs on surfaces. A: International Colloquium on Automata, Languages, and Programming. "Lecture notes in Computer Science (Volume 6198)". Bordeaux: Springer, 2010, p. 372-383.