@dblp

An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees.

, , , , and . IEEE Trans. Pattern Anal. Mach. Intell. 20 (8): 889-895 (1998)

Links and resources

URL:
BibTeX key:
journals/pami/WangSSZC98
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication