Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard
Computational Geometry
2020-10-06 v1
Abstract
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.
Cite
@article{arxiv.2010.01881,
title = {Recognizing embedded caterpillars with weak unit disk contact representations is NP-hard},
author = {Man-Kwun Chiu and Jonas Cleve and Martin Nöllenburg},
journal= {arXiv preprint arXiv:2010.01881},
year = {2020}
}
Comments
Appeared in EuroCG 2019