Delaunay Graphs Are Almost as Good as Complete Graphs.
Dobkin, D.P. ; Friedman, S.J. ; Supowit, K.J.
Discrete & computational geometry, Tome 5 (1990), p. 399-408 / Harvested from Göttinger Digitalisierungszentrum
Access to full text
Publié le : 1990-01-01
EUDML-ID : urn:eudml:doc:131128 
@article{GDZPPN000364509,
     title = {Delaunay Graphs Are Almost as Good as Complete Graphs.},
     journal = {Discrete \& computational geometry},
     volume = {5},
     year = {1990},
     pages = {399-408},
     zbl = {0693.05045},
     url = {http://dml.mathdoc.fr/item/GDZPPN000364509}
}

Dobkin, D.P.; Friedman, S.J.; Supowit, K.J. Delaunay Graphs Are Almost as Good as Complete Graphs.. Discrete & computational geometry, Tome 5 (1990) pp. 399-408. http://gdmltest.u-ga.fr/item/GDZPPN000364509/