z-logo
open-access-imgOpen Access
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
Author(s) -
Bmp Bart Jansen,
Hans L. Bodlaender
Publication year - 2011
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - kernelization , vertex cover , combinatorics , parameterized complexity , vertex (graph theory) , neighbourhood (mathematics) , edge cover , mathematics , feedback vertex set , time complexity , cover (algebra) , discrete mathematics , graph , mechanical engineering , mathematical analysis , engineering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here