Author:
Bunke Horst,Foggia Pasquale,Guidobaldi Corrado,Sansone Carlo,Vento Mario
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. J.R. Ullmann, “An Algorithm for Subgraph Isomorphism”, Journal of the Association for Computing Machinery, vol. 23, pp. 31–42, 1976.
2. L.P. Cordella, P. Foggia C. Sansone, M. Vento, “An Improved Algorithm for Matching Large Graphs”, Proc. of the 3rd IAPR-TC-15 International Workshop on Graph-based Representations, Italy, pp. 149–159, 2001.
3. H. Bunke X. Jiang and A. Kandel, “On the Minimum Supergraph of Two Graphs”, Computing 65, Nos. 13–25, pp. 13–25, 2000.
4. H. Bunke and K. Sharer, “A Graph Distance Metric Based on the Maximal Common Subgraph”, Pattern Recognition Letters, Vol. 19, Nos. 3–4, pp. 255–259, 1998.
5. G. Levi, “A Note on the Derivation of Maximal Common Subgraphs of Two Directed or Undirected Graphs”, Calcolo, Vol. 9, pp. 341–354, 1972.
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献