(Undergraduate Course Project) An Algorithm for Graph Matching with Restrictions on Edge Weights, Based on Number Theory, Linear Algebra and Randomization

It’s the course project of Numerical Analysis instructed by Prof. Wenjian Yu.

In this work, I put forward, analyzed and implemented an algorithm for a specific kind of graph matching problem with restrictions on edges. You can find the write-up here (only available in Chinese).