A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation.
Pawan AuroraShashank K. MehtaPublished in: J. Comb. Optim. (2020)
Keyphrases
- positive semidefinite
- graph isomorphism
- semidefinite
- semidefinite programming
- convex relaxation
- kernel matrix
- convex optimization
- graph mining
- graph search
- linear combination
- kernel methods
- metric learning
- linear programming
- multiple kernel learning
- subgraph isomorphism
- similarity function
- objective function
- primal dual
- graph data
- multi label
- pattern matching
- string kernels
- dynamic programming
- np hard
- pairwise