Algorithm Search⌘K

Problemintro

Parameterized vertex cover

Also called k-vertex cover, vertex cover parameterized by solution size.

Decide whether a graph has a vertex cover of size at most k; FPT by kernel and bounded search tree.

Decide whether a graph has a vertex cover of size at most k; FPT by kernel and bounded search tree.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator

Tag 2702D3 Edit this page History Report an error