@techreport{R-85-15,
TITLE = {Subgraph Isomorphism for Easily Separable Graphs of Bounded Valence},
AUTHOR = {Andrzej Lingas},
YEAR = {1985},
NUMBER = {R-85-15},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-85-15+abstr},
ABSTRACT = {A general method for solving the subgraph isomorphism for connected graphs with s(n)-separator and valence bounded by d(n) is presented. The method takes exp(O((d(n)+logn)s(n)logn)) time.},
IDANR = {LiTH-IDA-R-85-15},
NOTE = {Also in Proc. of International Workshop on Graphtheoretic Concepts in Computer Science, Castle Schwanberg, Wuerzburg, Germany, June 18-21, 1985}