Login / Signup

XNLP-hardness of Parameterized Problems on Planar Graphs.

Hans L. BodlaenderKrisztina Szilágyi
Published in: CoRR (2024)
Keyphrases
  • planar graphs
  • optimization problems
  • vertex cover
  • computational complexity
  • np complete