Login / Signup
An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs.
Taenam Kim
Kyung-Yong Chwa
Published in:
Inf. Process. Lett. (1987)
Keyphrases
</>
matching algorithm
bipartite graph
template matching
lower bound
image matching
worst case
log log
hausdorff distance
shape representation
matching process
shape matching
partial matching
maximum matching
graph matching
voting scheme
point matching
link prediction
fingerprint matching
social networks