Wei Huang

Towards Generative Graph Matching for Graph Edit Distance Computation

Small Shifts, Large Gains: Unlocking Traditional TSP Heuristic Guided-Sampling via Unsupervised Neural Instance Modification

RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning

Towards Unsupervised Training of Matching-based Graph Edit Distance Solver via Preference-aware GAN

DiffGED: Computing Graph Edit Distance via Diffusion-based Graph Matching

GQ*: Towards Generalizable Deep Q-Learning for Steiner Tree in Graphs