Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Question about bijective graphs isomorphism #2

Closed
wojdyr opened this issue Jan 23, 2021 · 2 comments
Closed

Question about bijective graphs isomorphism #2

wojdyr opened this issue Jan 23, 2021 · 2 comments

Comments

@wojdyr
Copy link

wojdyr commented Jan 23, 2021

Hi, thanks for making your code available.
I don't know much about graph algorithms, so it may be a naive question.

I'm looking for a C++ library that would allow me to iterate over all automorphisms of a graph. (background: I want to superpose two 3D models of small molecules. The graphs of a molecule can have symmetries, so I can't be sure which atoms in the two molecules correspond to each other. Therefore, I want to try all automorphisms of one of the molecules)

I read that this library can find graph isomorphisms. Am I right that it can be used to find automorphisms?
Your 2013 paper compares performance of the subgraph isomorphism algorithms. Do you know how the performance of graph isomorphism in RI compares to other algorithms/libraries such as nauty, saucy or bliss?

@vbonnici
Copy link
Member

vbonnici commented Jan 24, 2021 via email

@wojdyr
Copy link
Author

wojdyr commented Jan 25, 2021

Thanks for quick reply!

@wojdyr wojdyr closed this as completed Jan 25, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants