A method for enumerating pairwise compatibility graphs with a given number of vertices.
Naveed Ahmed AzamAleksandar ShurbevskiHiroshi NagamochiPublished in: Discret. Appl. Math. (2021)
Keyphrases
- pairwise
- high precision
- detection method
- high accuracy
- dynamic programming
- graph matching
- small number
- cost function
- significant improvement
- preprocessing
- computational complexity
- clustering method
- similarity measure
- random graphs
- probabilistic model
- graph representation
- undirected graph
- neural network
- computational cost
- face recognition