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

Re^3: How to compare two undirected graphs?

by dwm042 (Priest)
on Oct 19, 2010 at 17:07 UTC ( [id://866123]=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?

If your structures can be etched in a single layer onto the surface of a silicon wafer, it is almost certainly planer.

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

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://866123]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having a coffee break in the Monastery: (3)
As of 2025-06-21 13:30 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?
    erzuuliAnonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.