Generalizing an Approximate Subgraph Matching-based System to Extract Events in Molecular Biology and Cancer Genetics

Target Circuit Matching in Large-Scale Netlists using GNN-Based Region Prediction

Subgraph matching plays an important role in electronic design automation (EDA) and circuit verification. Traditional rule-based methods have limitations in generalizing to arbitrary target circuits. Furthermore, node-to…

ASM Kernel: Graph Kernel using Approximate Subgraph Matching for Relation Extraction

Approximate Subgraph Matching with Neural Graph Representations and Reinforcement Learning

Approximate subgraph matching (ASM) is a task that determines the approximate presence of a given query graph in a large target graph. Being an NP-hard problem, ASM is critical in graph analysis with a myriad of applicat…

Neural Subgraph Matching

Subgraph matching is the problem of determining the presence and location(s) of a given query graph in a large target graph. Despite being an NP-complete problem, the subgraph matching problem is crucial in domains rangi…

A Weighted Common Subgraph Matching Algorithm

We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph ma…