Kernelization and approximation of distance-r independent sets on nowhere dense graphs.
Michal PilipczukSebastian SiebertzPublished in: Eur. J. Comb. (2021)
Keyphrases
- distance measure
- graph theoretic
- point to point correspondences
- approximation algorithms
- approximation spaces
- graph matching
- graph theory
- hamming distance
- closed form
- convex sets
- absolute error
- directed graph
- graph representation
- stereo correspondence
- relative error
- approximation error
- approximation methods
- distance function