The number of bits needed to represent a unit disk graph

DOI10.1007/978-3-642-16926-7_29MaRDI QIDQ3057635zbMATH OpenOpenAlexFDO

Authors Tobias Müller, Colin 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 representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The number of disk graphs
• Counting disk graphs
• Unit disk graphs
• scientific article; zbMATH DE number 2235058
• Integer realizations of disk and segment graphs

Cites work

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

Cited in

(3)

• The number of disk graphs
• Sphere and dot product representations of graphs
• Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete

This page was built for publication: The number of bits needed to represent a unit disk graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057635)