A general backtrack algorithm for the isomorphism problem of combinatorial objects
From MaRDI portal
Publication:1087556
DOI10.1016/S0747-7171(85)80021-3zbMath0611.05030OpenAlexW2092777292MaRDI QIDQ1087556
Publication date: 1985
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(85)80021-3
Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Related Items
Computing Autotopism Groups of Partial Latin Rectangles, Constraint Orbital Branching, Practical graph isomorphism. II., Permutation group algorithms based on partitions. I: Theory and algorithms, Symmetric ILP: Coloring and small integers, An algorithm to simplify tensor expressions, Backtrack search with isomorph rejection and consistency check
Cites Work
- An algorithm for computing the automorphism group of a Hadamard matrix
- Group-theoretic algorithms and graph isomorphism
- Hadamard equivalence via graph isomorphism
- Pascal. User manual and report
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
- Computing automorphism groups of error-correcting codes
- The graph isomorphism disease
- Enumeration of latin squares with application to order 8
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item