This issuePrevious ArticleA-shaped bin packing: Worst case analysis via simulationNext ArticleOptimal preemptive online scheduling to minimize lp norm on two processors
Algorithms by layer-decomposition for the subgraph recognition problem with attributes
Given two planar graphs $G$ and $H$, the subgraph recognition problem (SRP)
is concerned with finding all isomorphic subgraphs of $H$ in $G$. Using the idea of
layer-decomposition, we develop algorithms for SRP that have computational complexity
$O(n(\Delta-1)^{k-1})$, where $\Delta$ is the degree of $G$ and $n, k$ are the orders of $G, H$
respectively.