Sign in

A polynomial-time algorithm for simple undirected graph isomorphism.

Jing HeGuangyan HuangJie CaoZhiwang ZhangHui ZhengPeng ZhangRoozbeh ZareiFerry SusantoRuchuan WangYimu JiWeibei FanZhijun XieXiancheng WangMengjiao GuoChi-Hung ChiJiekui ZhangYoutao LiXiaojun ChenYong ShiAndré Van Zundert
Published in: Concurr. Comput. Pract. Exp. (2022)
Keyphrases
  • graph isomorphism
  • computational complexity
  • worst case
  • objective function
  • np hard
  • dynamic programming
  • search space
  • tree structure
  • special case
  • hard problems