Sign in

A polynomial-time algorithm for simple undirected graph isomorphism.

Jing HeJinjun ChenGuangyan HuangJie CaoZhiwang ZhangHui ZhengPeng ZhangRoozbeh ZareiFerry SansotoRuchuan WangYimu JiWeibei FanZhijun XieXiancheng WangMengjiao GuoChi-Hung ChiPaulo A. de SouzaJiekui ZhangYoutao LiXiaojun ChenYong ShiDavid GreenTaraporewalla KersiAndré Van Zundert
Published in: Concurr. Comput. Pract. Exp. (2021)
Keyphrases
  • graph isomorphism
  • computational complexity
  • objective function
  • dynamic programming
  • worst case
  • optimal solution
  • matching algorithm
  • search algorithm
  • search space
  • np hard
  • greedy algorithm
  • graph mining
  • graph model