Bart Jansen
Vertex Cover Kernelization Revisited Upper and Lower Bounds for a Refined Parameter STACS 2011 Dortmund March 10 th 2011 Joint work with Hans Bodlaender Vertex Cover Input Graph G integer k
set vertexinstance coververtexsetcoverinstancesizereductionverticesmisindependentfeedbackrulespolynomialgraphedgelesssolution
Embed this Presentation
Available Downloads
Presentation (PPTX)
Document (PDF)
Download Notice
Download Presentation The PPT/PDF document "Bart Jansen" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.