Login / Signup

Kernelizing Problems on Planar Graphs in Sublinear Space and Polynomial Time.

Arindam BiswasJohannes Meintrup
Published in: CoRR (2023)
Keyphrases
  • planar graphs
  • np complete
  • special case
  • high dimensional
  • dynamic programming
  • optimization problems
  • minimum weight