Login / Signup

Atom-by-atom searching using massive parallelism. Implementation of the Ullmann subgraph isomorphism algorithm on the distributed array processor.

Peter WillettTerence WilsonStewart F. Reddaway
Published in: J. Chem. Inf. Comput. Sci. (1991)
Keyphrases
  • matching algorithm
  • scan line
  • search space
  • np hard
  • subgraph isomorphism
  • graph isomorphism
  • tree structure
  • parallel implementation
  • array processor
  • dynamic programming