Minimal Lipschitz Extensions for Vector-Valued Functions on Finite Graphs.
Johannes HertrichMiroslav BacákSebastian NeumayerGabriele SteidlPublished in: SSVM (2019)
Keyphrases
- vector valued functions
- graph kernels
- graph matching
- graph theoretic
- directed graph
- finite number
- efficient implementation
- graph databases
- pairwise
- graph theory
- neural network
- undirected graph
- graph representation
- weighted graph
- random graphs
- pointwise
- graph mining
- structured data
- kernel function
- shortest path
- social networks