Entering edit mode
11.5 years ago
rein07
•
0
Given two graphs with labeled nodes, labeled graph matching problem is finding an optimal one-to-one mapping between the two graphs.
The performance of the mapping is the summation of correctly aligned connection.
i.e. Two ends of the connection have the same labels in both graphs.
I am not sure if it models the protein ligand docking problem
