The Number of Bits Needed to Represent a Unit Disk Graph

DOI10.1007/978-3-642-16926-7_29zbMath1309.68154OpenAlexW1495794766MaRDI QIDQ3057635

Tobias Müller, Colin J. H. McDiarmid

Publication date: 16 November 2010

Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_29

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Sphere and dot product representations of graphs

Cites Work

• Solving systems of polynomial inequalities in subexponential time
• Intersection graphs of segments
• Unit disk graph recognition is NP-hard
• The Intrinsic Spread of a Configuration in R d
• Better Approximation Schemes for Disk Graphs

This page was built for publication: The Number of Bits Needed to Represent a Unit Disk Graph