Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More.
Parinya ChalermsookBundit LaekhanukitDanupon NanongkaiPublished in: SODA (2013)
Keyphrases
- graph matching
- worst case
- approximation error
- maximum cardinality
- partial order
- maximum matching
- bipartite graph
- lower bound
- maximum weight
- matching algorithm
- graph representation
- graph model
- upper bound
- random walk
- approximation algorithms
- graph theory
- pattern matching
- subgraph isomorphism
- np hard
- graph structure
- np complete
- graph theoretic
- directed graph
- image matching
- minimal spanning tree
- learning theory
- matching process
- error bounds
- partially ordered
- relational structures
- association graph
- connected components
- object recognition
- min sum
- adjacency matrix
- weighted graph
- edit distance
- computational complexity
- closed form