Iterative Expansion and Color Coding
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1950312
- Stereo matching using iterative reliable disparity map expansion in the color-spatial-disparity space
- Robust matching of 3D contours using iterative closest point algorithm improved by M-estimation.
- scientific article; zbMATH DE number 2044082
- An algorithm for 3D shape matching using spherical sectioning
Cited in
(12)- The \(k\)-distinct language: parameterized automata constructions
- Parameterized approximation algorithms for packing problems
- The control complexity of \(r\)-Approval: from the single-peaked case to the general case
- scientific article; zbMATH DE number 1950312 (Why is no real title available?)
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- Randomized parameterized algorithms for the kidney exchange problem
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
- Parameterized complexity of independent set in H-free graphs
- Using nondeterminism to design efficient deterministic algorithms
- Deterministic algorithms for matching and packing problems based on representative sets
- scientific article; zbMATH DE number 2081099 (Why is no real title available?)
- Parameterized complexity of independent set in \(H\)-free graphs
This page was built for publication: Iterative Expansion and Color Coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189047)