Login / Signup
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.
Benjamin Hellouin de Menibus
Takeaki Uno
Published in:
CoRR (2018)
Keyphrases
</>
graph matching
matching algorithm
feature points
independent set
image matching
keypoints
graph theory
matching process
pattern matching
object recognition
feature matching
shortest path
worst case
graph theoretic
subgraph isomorphism
maximum weight
special case