Geodesic
A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 369-382

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : sparse graph, complete graph, distance, error parameter, shortest path 
@article{DCG_1991__6_4_131164,
     author = {P.M. Vaidya},
     title = {A {Sparse} {Graph} {Almost} as {Good} as the {Complete} {Graph} on {Points} in {K} {Dimensions.}},
     journal = {Discrete & computational geometry},
     pages = {369--382},
     publisher = {mathdoc},
     volume = {6},
     number = {4},
     year = {1991},
     zbl = {0755.05059},
     url = {http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131164/}
}
TY  - JOUR
AU  - P.M. Vaidya
TI  - A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
JO  - Discrete & computational geometry
PY  - 1991
SP  - 369
EP  - 382
VL  - 6
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131164/
ID  - DCG_1991__6_4_131164
ER  - 
%0 Journal Article
%A P.M. Vaidya
%T A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
%J Discrete & computational geometry
%D 1991
%P 369-382
%V 6
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131164/
%F DCG_1991__6_4_131164
P.M. Vaidya. A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.. Discrete & computational geometry, Tome 6 (1991) no. 4, pp. 369-382. http://geodesic.mathdoc.fr/item/DCG_1991__6_4_131164/