On the enumeration of minimal non-pairwise compatibility graphs.
Naveed Ahmed AzamAleksandar ShurbevskiHiroshi NagamochiPublished in: J. Comb. Optim. (2022)
Keyphrases
- pairwise
- graph matching
- search space
- loss function
- similarity measure
- series parallel
- semi supervised
- higher order
- high order
- graph theory
- random graphs
- markov random field
- similarity function
- pairwise interactions
- data sets
- graph theoretic
- graph structure
- neural network
- graph representation
- spectral clustering
- multi class
- dynamic programming