The knowledge you are looking for is not Perl-specific, it's graph-specific, even if the language you are using is Perl. I'd look for a graph/graph-represention oriented forum for advice. I'm no expert on graph algorithms (and finding one among the perlmonks would be coincidental), but the problem of minimizing intersections while retaining other properies of a graph representation must have been studied.

Anno