Progressively Decomposing Graph Matching
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Access"
DOI: 10.1109/access.2019.2908925
Abstract: Existing approaches to graph matching mainly include two types, i.e., the Koopmans-Beckmann’s QAP formulation (KB-QAP) and Lawler’s QAP formulation (L-QAP). The former is advantageous in scalability but disadvantageous in generality, while the latter is exactly… read more here.
Keywords: progressively decomposing; method; qap; graph ... See more keywords