Laminar tight cuts in matching covered graphs.
Guantao ChenXing FengFuliang LuCláudio Leonardo LucchesiLianzhu ZhangPublished in: J. Comb. Theory, Ser. B (2021)
Keyphrases
- graph matching
- matching algorithm
- lower bound
- subgraph isomorphism
- maximum cardinality
- upper bound
- pattern matching
- matching process
- attributed relational graph
- graph matching algorithm
- series parallel
- graph databases
- shape matching
- edit distance
- feature matching
- graph model
- point sets
- spanning tree
- relational structures
- directed graph
- template matching
- association graph
- image matching
- video data
- neural network