Time: 11am Friday, 1st June, 2012
Location: SIT 124 Boardroom
Speaker: Cameron Silvestrini, University of Sydney
In this talk I will first discuss a method of vertex cover kernelisation, and will then introduce a method that will allow us to extend these rules by generating additional gadgets computationally to handle some of the more complicated cases. It can be shown that no such gadgets exist to handle certain vertices of degree 4 or higher.