Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
Susanna F. de RezendeJakob NordströmKilian RisseDmitry SokolovPublished in: CoRR (2019)
Keyphrases
- lower bound
- graph matching
- upper bound
- average case complexity
- subgraph isomorphism
- branch and bound
- maximum cardinality
- branch and bound algorithm
- matching algorithm
- association graph
- objective function
- worst case
- high dimensional
- np hard
- lower and upper bounds
- matching process
- edit distance
- image matching
- graph theory
- bipartite graph
- feature points
- directed graph
- sparse representation
- average case
- pattern matching
- optimal solution
- face recognition
- dense motion estimation