On Relaxing the Constraints in Pairwise Compatibility Graphs.
Tiziana CalamoneriRossella PetreschiBlerina SinaimeriPublished in: WALCOM (2012)
Keyphrases
- pairwise
- graph matching
- pairwise constraints
- pairwise similarities
- higher order
- directed graph
- semi supervised
- loss function
- graph theoretic
- data sets
- linear constraints
- constrained optimization
- planar graphs
- graph mining
- graph structure
- graph theory
- bipartite graph
- constraint programming
- np complete
- pattern recognition
- support vector