Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard

10/05/2020
by   Man-Kwun Chiu, et al.
0

Weak unit disk contact graphs are graphs that admit a representation of the nodes as a collection of internally disjoint unit disks whose boundaries touch if there is an edge between the corresponding nodes. We provide a gadget-based reduction to show that recognizing embedded caterpillars that admit a weak unit disk contact representation is NP-hard.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset