@InProceedings{	  valiente.martinez:wsp:1997,
  author	= {Gabriel Valiente and Conrado Mart{\'\i}nez},
  booktitle	= {Proc.\ 4th South American Workshop on String Processing},
  pages		= {180--197},
  publisher	= {Carleton University Press},
  series	= {International Informatics Series},
  title		= {An Algorithm for Graph Pattern-Matching},
  volume	= {8},
  year		= {1997},
  abstract	= {Graph pattern-matching is a generalization of string
		  matching and two-dimensional pattern-matching that offers a
		  natural framework for the study of matching problems upon
		  multi-dimensional structures. We present in this paper an
		  algorithm for pattern-matching on arbitrary graphs that is
		  based on reducing the problem of finding a homomorphic
		  image of a pattern graph in a target graph, to that of
		  finding homomorphic images of every connected component of
		  the pattern in the target. For every connected component,
		  the algorithm performs a combinatorial search bounded by a
		  pruning operator. The algorithm can be applied to directed
		  graphs as well as to undirected graphs, and it can also be
		  specialized to find isomorphic images only.},
  url		= {http://www.lsi.upc.es/~valiente/abs-wsp-1997.pdf}
}