Dynamic Programming for H-minor-free Graphs

DOI10.1007/978-3-642-32241-9_8zbMath1364.68231OpenAlexW94833323MaRDI QIDQ2914314

Dimitrios M. Thilikos, Ignasi Sau, Juanjo Rué

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_8

zbMATH Keywords

dynamic programminganalysis of algorithmsparameterized algorithmsgraph minorsnon-crossing partitionsbranchwidth

Mathematics Subject Classification ID

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

Related Items (6)

Contraction bidimensionality of geometric intersection graphs ⋮ Unnamed Item ⋮ Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds ⋮ The role of planarity in connectivity problems parameterized by treewidth ⋮ Contraction-Bidimensionality of Geometric Intersection Graphs ⋮ Dynamic programming for graphs on surfaces

This page was built for publication: Dynamic Programming for H-minor-free Graphs