Back to Results
First PageMeta Content
NP-complete problems / Parameterized complexity / Kernelization / Vertex cover / Graph coloring / Minimum k-cut / Algorithm / Independent set / Greedy algorithm / Theoretical computer science / Mathematics / Computational complexity theory


Greedy Localization, Iterative Compression and Modeled Crown Reductions: New FPT Techniques, an Improved Algorithm for Set Splitting and a Novel 2k Kernelization for Vertex Cover Frank Dehne1 , Mike Fellows2 , Frances Ro
Add to Reading List

Document Date: 2009-08-06 03:09:48


Open Document

File Size: 145,93 KB

Share Result on Facebook
UPDATE