David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit. Delaunay Graphs are Almost as Good as Complete Graphs. In 28th Annual Symposium on Foundations of Computer Science, 12-14 October 1987, Los Angeles, California, USA. pages 20-26, IEEE, 1987.
@inproceedings{DobkinFS87,
title = {Delaunay Graphs are Almost as Good as Complete Graphs},
author = {David P. Dobkin and Steven J. Friedman and Kenneth J. Supowit},
year = {1987},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/DobkinFS87},
cites = {0},
citedby = {0},
pages = {20-26},
booktitle = {28th Annual Symposium on Foundations of Computer Science, 12-14 October 1987, Los Angeles, California, USA},
publisher = {IEEE},
}