Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs

摘要

We give algorithms with running time 2(O(root k log k)) . n(O(1)) for the following problems. Given an n-vertex unit disk graph G and an integer k, decide whether G contains