Login / Signup
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism.
Haichuan Shang
Ying Zhang
Xuemin Lin
Jeffrey 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