ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
In this paper, we consider the Cycle Packing problem on unit disk graphs defined as follows. Given a unit disk graph G with n vertices and an integer k, the goal is to find a set of $k$ vertex-disjoint cycles of G if it exists. Our algorithm runs in time …