Hunting bugs with accelerated optimal graph vertex matching.
Xiaohui ZhangYuanjun GongBin LiangJianjun HuangWei YouWenchang ShiJian ZhangPublished in: ISSTA (2022)
Keyphrases
- maximum cardinality
- graph matching
- matching algorithm
- directed graph
- undirected graph
- maximum matching
- minimum weight
- optimal solution
- pattern matching
- bipartite graph
- dynamic programming
- maximum weight
- spanning tree
- directed acyclic graph
- edge weights
- minimum spanning tree
- graph clustering
- graph theory
- feature points
- association graph
- hamiltonian cycle
- open source
- worst case