Lossy kernels for connected distance-$r$ domination on nowhere dense graph classes.
Sebastian SiebertzPublished in: CoRR (2017)
Keyphrases
- neighborhood graph
- connected components
- data compression
- graph kernels
- binary images
- quasi cliques
- graph structure
- support vector
- equivalence classes
- kernel function
- euclidean distance
- bipartite graph
- graph theory
- structured data
- distance measure
- graph construction
- graph matching
- graph representation
- connected graphs
- edge weights
- weighted graph
- linear combination
- random walk
- data points
- similarity measure
- gaussian processes
- graph databases
- graph model
- path length
- feature space
- densely connected
- bounded degree
- point to point correspondences
- clustering algorithm