Dynamic programming for graphs on surfaces

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/104306

Title:	Dynamic programming for graphs on surfaces
Author:	Rué Perna, Juan José; Sau, Ignasi; Thilikos, Dimitrios
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtiques; Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
Abstract:	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.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Equacions diferencials i integrals -Dynamic programming -analysis of algorithms -parameterized algorithms -analytic combinatorics -graphs on surfaces -branch width dynamic programming -polyhedral embeddings -symbolic method -non-crossing partitions -Grafs, Teoria dels
Rights:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Document type:	Article - Updated version Conference Object
Published by:	Springer
Share: