Search Results for author:
Found 2 papers, 1 papers with code
GuP: Fast Subgraph Matching by Guard-based Pruning
Subgraph matching, which finds subgraphs isomorphic to a query, is the key to information retrieval from data represented as a graph.
Fast Subgraph Matching by Exploiting Search Failures
That is, our algorithm generates failure patterns when a partial embedding is found unable to become an isomorphic embedding.
Databases
Cannot find the paper you are looking for? You can
Submit a new open access paper.
