Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More
Parinya ChalermsookBundit LaekhanukitDanupon NanongkaiPublished in: CoRR (2012)
Keyphrases
- graph matching
- worst case
- approximation error
- maximum matching
- matching algorithm
- graph representation
- lower bound
- graph theory
- maximum weight
- stable set
- graph model
- partial order
- directed graph
- random walk
- upper bound
- maximum cardinality
- association graph
- keypoints
- structured data
- approximation algorithms
- np hard
- object recognition
- weighted graph
- shape matching
- bipartite graph
- matching process
- graph partitioning
- computational complexity
- undirected graph
- graph structure
- graph theoretic
- bayesian networks
- relational structures
- subgraph isomorphism
- information theoretic
- pattern matching
- min sum
- np complete