Login / Signup
A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
Dániel Marx
Pranabendu Misra
Daniel Neuen
Prafullkumar Tale
Published in:
CoRR (2021)
Keyphrases
</>
planar graphs
vertex cover
optimization problems
combinatorial optimization
problems in computer vision
max cut
markov chain
graph theory