DeepAI
Log In Sign Up

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

page 4

page 5

page 6

page 7

page 9

10/05/2020

Weak Unit Disk Contact Representations for Graphs without Embedding

Weak unit disk contact graphs are graphs that admit representing nodes a...
03/15/2021

Unit Disk Representations of Embedded Trees, Outerplanar and Multi-Legged Graphs

A unit disk intersection representation (UDR) of a graph G represents ea...
08/24/2021

Layered Area-Proportional Rectangle Contact Representations

We investigate two optimization problems on area-proportional rectangle ...
07/18/2019

On Arrangements of Orthogonal Circles

In this paper, we study arrangements of orthogonal circles, that is, arr...
11/24/2018

Axes-parallel unit disk graph recognition is NP-hard

Unit disk graphs are the intersection graphs of unit diameter disks in t...
12/29/2017

Effective algorithms for homogeneous utility functions

Under the assumption of (positive) homogeneity (PH in the sequel) of the...