|
Resolution: standard / high Figure 11.
Example of tree-based graph matching process. An example of the search tree traversed by the A* algorithm during the matching of
two graphs G and G’.
Sharma et al. Diagnostic Pathology 2012 7:134 doi:10.1186/1746-1596-7-134 |
