Extension of partial atom-to-atom maps: uniqueness and algorithms
From MaRDI portal
Cites work
- A Faster Isomorphism Test for Graphs of Small Degree
- A software package for chemically inspired graph transformation
- Comparison of Atom Maps
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Noncommercial software for mixed-integer linear programming
- VF2++ -- an improved subgraph isomorphism algorithm
This page was built for publication: Extension of partial atom-to-atom maps: uniqueness and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7302699)