Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.

D. Eppstein

Discrete & computational geometry (1995)

  • Volume: 13, Issue: 1, page 111-122
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Eppstein, D.. "Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.." Discrete & computational geometry 13.1 (1995): 111-122. <http://eudml.org/doc/131349>.

@article{Eppstein1995,
author = {Eppstein, D.},
journal = {Discrete & computational geometry},
keywords = {spanning tree; ordered nearest neighbor path; dynamic algorithms},
number = {1},
pages = {111-122},
title = {Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.},
url = {http://eudml.org/doc/131349},
volume = {13},
year = {1995},
}

TY - JOUR
AU - Eppstein, D.
TI - Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
JO - Discrete & computational geometry
PY - 1995
VL - 13
IS - 1
SP - 111
EP - 122
KW - spanning tree; ordered nearest neighbor path; dynamic algorithms
UR - http://eudml.org/doc/131349
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.