The Number of Bits Needed to Represent a Unit Disk Graph

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

• Type: Journal
• Year: 2010
• Where: WG
• Authors: Colin McDiarmid, Tobias Müller
• Keywords: Theoretical Computer Science, Unit Disk Graphs, WG 2010