If I have a graph (not necessarily planar ) embedded in the plane and a point $p$ in the plane.
Can I somehow efficiently find the shortest cycle containing $p$ in its interior?
If I have a graph (not necessarily planar ) embedded in the plane and a point $p$ in the plane.
Can I somehow efficiently find the shortest cycle containing $p$ in its interior?