Publication:4335302
From MaRDI portal
zbMath0878.05063MaRDI QIDQ4335302
Publication date: 5 January 1998
partition; computational complexity; automorphisms; hashing; graph isomorphism; backtrack; gadgets; vertex labellings; McKay's algorithm; stable vertex colourings
68Q25: Analysis of algorithms and problem complexity
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Unnamed Item, Benchmark Graphs for Practical Graph Isomorphism, Graph matching using the interference of continuous-time quantum walks, Gathering robots in graphs: the central role of synchronicity, Novel techniques to speed up the computation of the automorphism group of a graph, New invariants for the graph isomorphism problem, Information theoretic measures of UHG graphs with low computational complexity, Tight lower and upper bounds for the complexity of canonical colour refinement, Symmetry Breaking Constraints for the Minimum Deficiency Problem
Uses Software