scientific article; zbMATH DE number 1004939
From MaRDI portal
Publication:4335302
zbMath0878.05063MaRDI QIDQ4335302
Publication date: 5 January 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partitioncomputational complexityautomorphismshashinggraph isomorphismbacktrackgadgetsvertex labellingsMcKay's algorithmstable vertex colourings
Analysis of algorithms and problem complexity (68Q25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (9)
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 ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Benchmark Graphs for Practical Graph Isomorphism ⋮ Graph matching using the interference of continuous-time quantum walks ⋮ Unnamed Item ⋮ Novel techniques to speed up the computation of the automorphism group of a graph
Uses Software
This page was built for publication:
