A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.

P.M. Vaidya

Discrete & computational geometry (1991)

  • Volume: 6, Issue: 4, page 369-382
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Vaidya, P.M.. "A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.." Discrete & computational geometry 6.4 (1991): 369-382. <http://eudml.org/doc/131164>.

@article{Vaidya1991,
author = {Vaidya, P.M.},
journal = {Discrete & computational geometry},
keywords = {sparse graph; complete graph; distance; error parameter; shortest path},
number = {4},
pages = {369-382},
title = {A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.},
url = {http://eudml.org/doc/131164},
volume = {6},
year = {1991},
}

TY - JOUR
AU - Vaidya, P.M.
TI - A Sparse Graph Almost as Good as the Complete Graph on Points in K Dimensions.
JO - Discrete & computational geometry
PY - 1991
VL - 6
IS - 4
SP - 369
EP - 382
KW - sparse graph; complete graph; distance; error parameter; shortest path
UR - http://eudml.org/doc/131164
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.