7. The method of claim 1 , wherein the Ullman's algorithm of the comparing step utilizes a depth-first search procedure with a greedy heuristic choice.
7. The method of claim 1 , wherein the Ullman's algorithm of the comparing step utilizes a depth-first search procedure with a greedy heuristic choice. 8. The method of claim 7 , wherein the greedy heuristic choice chooses a node binding that produces a matrix with a fewest number of unbound nodes.