Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs.
Ying LiuShiteng ChenPublished in: STACS (2024)
Keyphrases
- lower bound
- graph matching
- vc dimension
- upper bound
- matching algorithm
- objective function
- pattern matching
- matching process
- optimal solution
- average case complexity
- association graph
- graph theoretic
- graph theory
- attributed relational graph
- graph matching algorithm
- sample complexity
- subgraph isomorphism
- branch and bound algorithm
- upper and lower bounds
- feature points
- np hard
- maximum cardinality
- worst case
- keypoints
- branch and bound
- average case
- graph partitioning
- undirected graph
- image matching
- weighted graph