Login / Signup

Constrained Level Planarity is FPT with Respect to the Vertex Cover Number.

Boris KlemzMarie Diana Sieper
Published in: CoRR (2024)
Keyphrases
  • frequent patterns
  • vertex cover
  • computational complexity
  • message passing