The number of bits needed to represent a unit disk graph

Authors:
Colin McDiarmid;Tobias Müller
Affiliations:
University of Oxford;Centrum Wiskunde & Informatica
Venue:
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Year:
2010

Citing 4
Cited 2

Theory of linear and integer programming

Theory of linear and integer programming
Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation
Intersection graphs of segments

Journal of Combinatorial Theory Series B
Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs

Convex polygon intersection graphs

GD'10 Proceedings of the 18th international conference on Graph drawing
Integer realizations of disk and segment graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c√n bits are needed to write down the coordinates of the centers of the disks, for some c 1. We also show that dn bits always suffice, for some d 1.