scientific article; zbMATH DE number 3619943
From MaRDI portal
Publication:4182548
Cited in
(8)- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Hadamard equivalence via graph isomorphism
- Pruning the search tree in the constructive enumeration of molecular graphs
- Classical symmetries and the quantum approximate optimization algorithm
- Practical graph isomorphism. II.
- Computing Autotopism Groups of Partial Latin Rectangles
- Structural position vectors and symmetries in complex networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182548)