Chen Avin. Distance graphs: from random geometric graphs to Bernoulli graphs and between. In Michael Segal, Alexander Kesselman, editors, Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008. pages 71-78, ACM, 2008. [doi]
@inproceedings{Avin08,
title = {Distance graphs: from random geometric graphs to Bernoulli graphs and between},
author = {Chen Avin},
year = {2008},
doi = {10.1145/1400863.1400878},
url = {http://doi.acm.org/10.1145/1400863.1400878},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Avin08},
cites = {0},
citedby = {0},
pages = {71-78},
booktitle = {Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008},
editor = {Michael Segal and Alexander Kesselman},
publisher = {ACM},
isbn = {978-1-60558-244-3},
}