Congratutations on your great work on graph matching. Here I have two concerns hoping to get your reply.
On another issue you replied 'To identify where the query graph appears within the target graph, one can make use of the outputted alignment matrices -- subgraph_matching/alignment.py outputs such a matrix'. So far do you have any updates on this problem that could accurately achieve localization?
You also replied that you have a new version using graph node labels? Can you please send me (wei.909@osu.edu) a copy of code doing that ? Have you ever tried use more graph attributes such as node feature, edge label or edge feature to improve your graph matching performance?
Congratutations on your great work on graph matching. Here I have two concerns hoping to get your reply.
Thanks,