Login / Signup

Taming verification hardness: an efficient algorithm for testing subgraph isomorphism.

Haichuan ShangYing ZhangXuemin LinJeffrey Xu Yu
Published in: Proc. VLDB Endow. (2008)
Keyphrases
  • computational complexity
  • worst case
  • np hard
  • matching algorithm
  • dynamic programming
  • subgraph isomorphism
  • search space
  • graph isomorphism