Ultrametric Violation Distance, parameterized by the number k of edited distances, admits a kernel with O(k^2) points and an FPT algorithm running in O(9^k k n^2) time.
Clustering with qualitative information
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Ultrametric Violation Distance: Polynomial Kernel and FPT Algorithm
Ultrametric Violation Distance, parameterized by the number k of edited distances, admits a kernel with O(k^2) points and an FPT algorithm running in O(9^k k n^2) time.