A kernel with O(k^{t-1}) vertices and edges for K_t-free edge deletion, improving on the previous O(k^{t(t-1)/2}) bound.
Grap h-modeled data clustering: Exact algorithms for clique generation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Kernel for Kt-free edge deletion
A kernel with O(k^{t-1}) vertices and edges for K_t-free edge deletion, improving on the previous O(k^{t(t-1)/2}) bound.