Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph is...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!