Improving isomorphism rejection in sets of graphs

MaRDI QIDQ5405515zbMATH OpenFDO

Authors John A. Bate

Publication date 2 April 2014

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• Isomorph-Free Exhaustive Generation
• scientific article; zbMATH DE number 1522743
• Algorithmic aspects of algebraic methods for graph isomorphism testing

Cited in

(3)

• Advances in Polytime Isomorph Elimination for Configuration
• An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
• Constructing all nonisomorphic supergraphs with isomorphism rejection

This page was built for publication: Improving isomorphism rejection in sets of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405515)