Kernelization and approximation of distance-r independent sets on nowhere dense graphs.
Michal PilipczukSebastian SiebertzPublished in: CoRR (2018)
Keyphrases
- absolute error
- distance measure
- point to point correspondences
- graph theoretic
- graph mining
- graph structure
- approximation error
- approximation methods
- hamming distance
- graph databases
- weighted graph
- approximation ratio
- closed form
- euclidean distance
- image sequences
- euclidean norm
- neighborhood graph
- quasi cliques
- approximation spaces
- graph clustering
- convex sets
- graph representation
- approximation algorithms
- distance function
- graphical models
- pairwise
- feature space