Surface split decompositions and subgraph isomorphism in graphs on surfaces

DOI10.4230/LIPICS.STACS.2012.531MaRDI QIDQ2904791zbMATH OpenFDO

Authors Paul Bonsma

Publication date 23 August 2012

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

zbMATH Keywords

dynamic programminganalysis of algorithmsgraphs on surfacesparameterized algorithmssubgraph isomorphismbranch decompositionscounting probl

Mathematics Subject Classification ID

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

Recommendations

• Planar subgraph isomorphism revisited
• Subgraph Isomorphism in Planar Graphs and Related Problems
• Publication:4886099
• Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
• Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus

Cited in

(5)

• Planar subgraph isomorphism revisited
• Quasipolynomiality of the Smallest Missing Induced Subgraph
• A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
• Subgraph isomorphism on graph classes that exclude a substructure
• scientific article; zbMATH DE number 910922 (Why is no real title available?)

This page was built for publication: Surface split decompositions and subgraph isomorphism in graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904791)