On a k-matching algorithm and finding k-factors in random graphs with minimum degree k+1 in linear time.

Michael Anastos

Published in: CoRR (2021)

Keyphrases

matching algorithm
random graphs
graph theoretic
template matching
image matching
matching process
phase transition
graph matching
hausdorff distance
voting scheme
power law
small world
worst case
undirected graph
special case
deformable template
matching strategy
pattern matching algorithm
shape matching