Progressively Decomposing Graph Matching
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 the opposite. In this paper,...
Main Authors: | Jin-Gang Yu, Lichao Xiao, Jiarong Ou, Zhifeng Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8679956/ |
Similar Items
-
A note on arbitrarily vertex decomposable graphs
by: Antoni Marczyk
Published: (2006-01-01) -
PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN
by: Muchammad Abrori, et al.
Published: (2012-06-01) -
PENENTUAN MATCHING MAKSIMUM PADA GRAF BIPARTIT BERBOBOT MENGGUNAKAN METODE HUNGARIAN
by: Muchammad Abrori, et al.
Published: (2012-06-01) -
Constructing an algorithm of quadratic time complexity for finding the maximal matching
by: Andrii Morozov, et al.
Published: (2019-12-01) -
Spatial, Temporal and Spatio-Temporal Correspondence for Computer Vision Problems
by: Zhou, Feng
Published: (2014)