Login / Signup

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.

Dániel MarxPranabendu MisraDaniel NeuenPrafullkumar Tale
Published in: SODA (2022)
Keyphrases
  • planar graphs
  • vertex cover
  • optimization problems
  • problems in computer vision
  • bayesian networks
  • worst case
  • latent variables
  • max cut