Canonical Number and NutCracker: Heuristic Algorithms for the Graph Isomorphism Problem using Free Energy

@article{Cui2016CanonicalNA,
  title={Canonical Number and NutCracker: Heuristic Algorithms for the Graph Isomorphism Problem using Free Energy},
  author={Cewei Cui and Zhe Dang},
  journal={CoRR},
  year={2016},
  volume={abs/1605.07220}
}
This paper develops two heuristic algorithms to solve graph isomorphism, using free energy encoding. The first algorithm uses four types of encoding refinement techniques such that every graph can be distinguished by a canonical number computed by the algorithm. The second algorithm injects energy into the graph to conduct individualization such that the correspondence relation between a pair of isomorphic graphs can be found. The core principle behind the two algorithms is encoding discrete… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 5 times over the past 90 days. VIEW TWEETS