@article{Ullmann:1976,
  abstract = {Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating succesor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs. A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been built. The hardware implementation would allow very rapid determination of isomorphism.},
  added-at = {2009-02-12T00:26:08.000+0100},
  author = {Ullmann, J.R.},
  biburl = {http://www.bibsonomy.org/bibtex/210dc5894dcaaf52087bfd2374d849c66/diego_ma},
  comments = {Doesn't attempt to find the maximum common subgraph},
  interhash = {b016bd0064f8aa342720036386d0f1c3},
  intrahash = {10dc5894dcaaf52087bfd2374d849c66},
  journal = {Journal of the ACM},
  keywords = {graph_isomorphism directed_graph_isomorphism search_tree clique_detection subgraph_isomorphism algorithm game_tree clique subgraph graph isomorphism tree_search asynchronous_sequential_circuits special_purpose_computer digraph_isomorphism logic-in-memory_arrays Boolean_matrices parallel_processing array_processing},
  library = {Mine (OSP, Dec'2005)},
  number = 1,
  pages = {31-42},
  timestamp = {2009-02-12T00:26:08.000+0100},
  title = {An Algorithm for Subgraph Detection},
  volume = 23,
  year = 1976
}