Dynamic Programming for Graphs on Surfaces

DOI10.1007/978-3-642-14165-2_32zbMath1288.05286arXiv1104.2486OpenAlexW2569141772MaRDI QIDQ3587392

Ignasi Sau, Juanjo Rué, Dimitrios M. Thilikos

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.2486

zbMATH Keywords

dynamic programminganalysis of algorithmsparameterized algorithmsanalytic combinatoricsgraphs on surfacesnon-crossing partitionsbranchwidthpolyhedral embeddingssymbolic method

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Graph Minors and Parameterized Algorithm Design ⋮ Unnamed Item ⋮ Catalan structures and dynamic programming in \(H\)-minor-free graphs ⋮ Parameterized domination in circle graphs ⋮ On approximating the \(d\)-girth of a graph ⋮ Faster parameterized algorithms for minor containment ⋮ Confronting intractability via parameters ⋮ Fast minor testing in planar graphs

This page was built for publication: Dynamic Programming for Graphs on Surfaces