Computing Weighted Subset Transversals in $H$-Free Graphs

no code implementations • 28 Jul 2020 • Nick Brettell, Matthew Johnson, Daniel Paulusma

For the Odd Cycle Transversal problem, the task is to find a small set $S$ of vertices in a graph that intersects every cycle of odd length.

Data Structures and Algorithms Discrete Mathematics Combinatorics