thesis proposes an efficient screening algorithm to solve the inexact sub-graphisomorphism problems by incrementally reducing the infeasible search space.

• 化问题，本文提出一个快速筛选法来求解非精确子图同构问题；