scientific article

DOI10.4230/LIPIcs.STACS.2012.531zbMath1244.05214arXiv1109.4554MaRDI QIDQ2904791

Paul Bonsma

Publication date: 23 August 2012

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programminganalysis of algorithmssubgraph isomorphismparameterized algorithmsgraphs on surfacesbranch decompositionscounting probl

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface ⋮ Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Subgraph isomorphism on graph classes that exclude a substructure

This page was built for publication: