Hitting Weighted Even Cycles in Planar Graphs

Alexander Göke, Jochen Koenemann, Matthias Mnich +1

A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs…