The number of bits needed to represent a unit disk graph

Colin McDiarmid; Tobias Müller

doi:10.1007/978-3-642-16926-7_29

The number of bits needed to represent a unit disk graph

Colin McDiarmid, Tobias Müller

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	Graph-theoretic concepts in computer science
Subtitle of host publication	36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers
Publisher	Springer
Pages	315-323
Number of pages	9
DOIs	https://doi.org/10.1007/978-3-642-16926-7_29
Publication status	Published - 2010
Externally published	Yes

Publication series

Name	Lecture Notes in Computer Science
Volume	6410
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-16926-7_29

http://dx.doi.org/10.1007/978-3-642-16926-7_29

Cite this

@inproceedings{f99204f91d76429fbf725aab56d81332,

title = "The number of bits needed to represent a unit disk graph",

author = "Colin McDiarmid and Tobias M{\"u}ller",

year = "2010",

doi = "10.1007/978-3-642-16926-7_29",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "315--323",

booktitle = "Graph-theoretic concepts in computer science",

}

The number of bits needed to represent a unit disk graph. / McDiarmid, Colin; Müller, Tobias.
Graph-theoretic concepts in computer science: 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers. Springer, 2010. p. 315-323 (Lecture Notes in Computer Science; Vol. 6410).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review