« first day (3147 days earlier)      last day (41 days later) » 

3:33 PM
0
Q: Finding a kernel for d-Bounded degree deletion

sashasIn $d$ Bounded degree deletion problem, we are given an undirected graph $G$ and a positive integer $k$, and the task is to find at most $k$ such vertices whose removal decreases the the maximum vertex degree of the graph to at most $d$. The question is to how to find a polynomial kernel (in $k$ ...

any help appreciated
 

« first day (3147 days earlier)      last day (41 days later) »