@techreport{R-89-05,
TITLE = {A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs},
AUTHOR = {Andrzej Lingas and Maciej M. Syslo },
YEAR = {1989},
NUMBER = {R-89-05},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-89-05+abstr},
ABSTRACT = {We present the first polynomial-time algorithm for the subgraph isomorphism problem restricted to two-connected series-parallel graphs, which uses a new decomposition technique. We also show that this problem is in random NC, and that it is in NC if the input graphs are of bounded valence.},
IDANR = {LiTH-IDA-R-89-05},
NOTE = {Also in Proc. of the 15th International Qolloquium on Automata, Languages and Programming, Tampere, Finland, July 1988}