Perfect graphs with polynomially computable kernels.
Adèle Pass-LanneauAyumi IgarashiFrédéric MeunierPublished in: CoRR (2018)
Keyphrases
- graph kernels
- graph matching
- np complete
- kernel function
- graph theory
- positive definite
- neural network
- bipartite graph
- gaussian processes
- graph theoretic
- turing machine
- dnf formulas
- gaussian kernels
- graph clustering
- graph partitioning
- complex structures
- spanning tree
- graph model
- linear combination
- upper bound
- feature space