@techreport{R-89-07,
TITLE = {Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in NC},
AUTHOR = {Andrzej Lingas},
YEAR = {1989},
NUMBER = {R-89-07},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-89-07+abstr},
ABSTRACT = {It is shown that the problem of subgraph isomorphism for connected graphs of bounded valence and bounded separator admits a deterministic parallel algorithm running in poly-log time and using a polynomial number of processors.},
IDANR = {LiTH-IDA-R-89-07},
NOTE = {Also in Proc. of 1988 International Conference on Parallel Processing, Chicago, USA, August 1988}