Next Previous Contents

5. References

  1. D. C. Schmidt, L. E. Druffel. ``A Fast Backtracking Algorithm for Test Directed Graphs for Isomorphism'', Journal of the Assoc. for Computing Machinery, 23, pp. 433-445, 1976.
  2. J. R. Ullmann. ``An Algorithm for Subgraph Isomorphism'', Journal of the Assoc. for Computing Machinery, 23, pp. 31-42, 1976.
  3. L. P. Cordella, P. Foggia, C. Sansone, M. Vento. ``Performance Evaluation of the VF Graph Matching Algorithm'', Proc. of the 10th ICIAP, IEEE Computer Society Press, vol. 2, pp. 1038-1041, 1999.
  4. P. Foggia, C. Sansone, M. Vento. ``An Improved Algorithm for Matching Large Graphs'', accepted for the 3rd IAPR-TC15 Workshop on Graph-based Representations, Ischia, 2001.
  5. P. Foggia, R. Genna, M. Vento. ``Symbolic vs. Connectionist Learning: An Experimental Comparison in a Structured Domain'', IEEE Trans. on Knowledge and Data Engineering, vol. 13, n. 2, 2001.


Next Previous Contents