Sorry, I should have mentioned that I'm running on Windows using ActivePerl.

A little more detail about the part that's dying:

For each node n in graph 1 and m in graph 2 do a bunch of comparisons between n and m and come up with a score. Store this in a 3 dim hash: score{comparison}{n}{m}