Perfect graphs with polynomially computable kernels.

Adèle Pass-Lanneau Ayumi Igarashi Frédéric Meunier

Published in: Discret. Appl. Math. (2020)

Keyphrases

graph kernels
np complete
graph matching
kernel methods
kernel function
graph structure
graph mining
graph theory
weighted graph
graph theoretic
multiple kernel learning
kernel learning
random graphs
lower bound
dimensionality reduction
linear combination