Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris

Re^3: How to compare two undirected graphs?

by LanX (Bishop)
on Oct 18, 2010 at 21:54 UTC ( #866051=note: print w/replies, xml ) Need Help??

in reply to Re^2: How to compare two undirected graphs?
in thread How to compare two undirected graphs?

Don't know much about transistor schematics.

So your talking about identifying isomorphic subgraphs which are only connected via two nodes (IN and OUT) to the rest of the graph?

As long as those subgraphs are not too big you can simply use a brute force normalization of the incidence matrix, i.e. trying all permutations until certain criterias are optimized.

Sorry anything else is IMHO far too complicated for perlmonks, this doesn't only fill bookshelves it fills international conferences.

Cheers Rolf

  • Comment on Re^3: How to compare two undirected graphs?

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://866051]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (9)
As of 2018-04-25 18:39 GMT
Find Nodes?
    Voting Booth?