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’.
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’.