@techreport{R-87-10,
TITLE = {On Parallel Complexity of the Subgraph Isomorphism Problem},
AUTHOR = {Andrzej Lingas},
YEAR = {1987},
NUMBER = {R-87-10},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-87-10+abstr},
ABSTRACT = {A simple parallel algorithm for subgraph isomorphism for graphs of valence d(n) and separator s(n) is presented. The algorithm runs in time O((logn)**3 d(n)s(n)) and uses exp(O(s(n)logn(d(n)+logn)) processors.},
IDANR = {LiTH-IDA-R-87-10}