Login / Signup
A tight lower bound on the matching number of graphs via Laplacian eigenvalues.
Xiaofeng Gu
Muhuo Liu
Published in:
Eur. J. Comb. (2022)
Keyphrases
</>
lower bound
upper bound
graph matching
small number
feature points
worst case
objective function
optimal solution
graph representation