Planar Subgraph Isomorphism Revisited
From MaRDI portal
Publication:3113755
DOI10.4230/LIPIcs.STACS.2010.2460zbMath1230.68230OpenAlexW1512232443MaRDI QIDQ3113755
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_7d84.html
Analysis of algorithms (68W40) Dynamic programming (90C39) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (22)
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering ⋮ Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ Linear Time Parameterized Algorithms for Subset Feedback Vertex Set ⋮ What’s Next? Future Directions in Parameterized Complexity ⋮ On the complexity of submap isomorphism and maximum common submap problems ⋮ Polynomial algorithms for open plane graph and subgraph isomorphisms ⋮ A general purpose algorithm for counting simple cycles and simple paths of any length ⋮ Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs ⋮ Subgraph isomorphism in graph classes ⋮ On approximating the \(d\)-girth of a graph ⋮ Faster parameterized algorithms for minor containment ⋮ Polynomial bounds for centered colorings on proper minor-closed graph classes ⋮ Fast minor testing in planar graphs ⋮ A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families ⋮ Slightly Superexponential Parameterized Problems ⋮ Linear kernels and linear-time algorithms for finding large cuts ⋮ On Approximating the d-Girth of a Graph ⋮ Subgraph isomorphism on graph classes that exclude a substructure ⋮ Computing the Overlaps of Two Maps ⋮ Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs ⋮ A Linear-Time Parameterized Algorithm for Node Unique Label Cover
This page was built for publication: Planar Subgraph Isomorphism Revisited
