Skip to main navigation
Skip to search
Skip to main content
Utrecht University Home
Help & FAQ
Link opens in a new tab
Search content at Utrecht University
Home
People
Research units
Research output
Activities
In the media
Prizes & Grants
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
Bart M. P. Jansen
,
Hans L. Bodlaender
Research output
:
Contribution to journal
›
Article
›
Academic
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Lower and upper bounds
100%
Kernelization
100%
Polynomial Time
100%
Polynomial
66%
Edge
66%
Sharp Contrast
33%
Covering Number
33%
Cardinality
33%
Keyphrases
Vertex Cover
100%
Kernelization
100%
Polynomial Time
33%
Feedback Vertex Set
33%
Number of Vertices
16%
Polynomial Kernel
16%
Parameterized Complexity
16%
Third Level
16%
Polynomial Hierarchy
16%
Cardinality
16%
Vertex Cover Problem
16%
Vertex Cover number
16%
Polynomial-time Preprocessing
16%
K Parameter
16%
Cobalt Nanoparticles (CoNPs)
16%
Kernel Size
16%
Weighted Vertex Cover
16%
Subset Feedback Vertex Set
16%