dr. Oliver Schaudt – The Price of Connectivity for Vertex Cover

19.03.2012 Lecturer: dr. Oliver Schaudt (Universität zu Köln, Germany).

Title: The Price of Connectivity for Vertex Cover

Abstract: We study a graph parameter called the Price of Connectivity for Vertex Cover (PoC). It was recently introduced by Cardinal et al. and is defined as the ratio of the minimum size of a connected vertex cover and the minimum size of a vertex cover.We prove some structural results for the PoC. These results concern PoC-critical, PoC-perfect and PoC-near-perfect graphs.
Joint work with E. Camby, J. Cardinal and S. Fiorini.
 
Slides from the talk are available here: DOWNLOAD!
 

Share with others

Accessibility Toolbar

Privacy Overview

This website uses cookies so that we can provide you with the best user experience possible. Cookie information is stored in your browser and performs functions such as recognising you when you return to our website and helping our team to understand which sections of the website you find most interesting and useful.