In today’s world, Graph similarity computation (GSC) plays an important role in various applications such as code detection, molecular graph similarity, image matching, etc., by evaluating the ...
Application and library to solve (multi-)graph matching problems. For licensing term, see the LICENSE file. This work uses third party software. Please refer to LICENSE-3RD-PARTY.txt for an overview ...
Capturing semantic and structural attributes of objects together with their spatial relationships is vital for achieving human-like scene understanding, thereby enhancing robotic tasks such as object ...
Abstract: Graph matching aims to establish node correspondences between graphs, which is a classic combinatorial optimization problem. In recent years, (deep) learning-based methods have emerged as a ...
Abstract: Graph matching over two given graphs is a well-established method for re-identifying obscured node labels within an anonymous graph by matching the corresponding nodes in a reference graph.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results