Login / Signup

An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants.

Matthias DehmerMartin GrabnerAbbe MowshowitzFrank Emmert-Streib
Published in: Adv. Comput. Math. (2013)
Keyphrases
  • graph isomorphism
  • graph search
  • search algorithm
  • depth first search
  • optimal solution
  • social networks
  • object recognition
  • memory efficient
  • subgraph isomorphism