activity
20132018
most citedEfficient Learning of Optimal Markov Network Topology with k-Tree Modeling

21 citations · 21 across the 3 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2013

Polynomial kernels collapse the W-hierarchy

Liang Ding, Abdul Samad, Xingran Xue +2

We prove that, for many parameterized problems in the class FPT, the existence of polynomial kernels implies the collapse of the W-hierarchy (i.e., W[P] = FPT). The collapsing resu…