Algorithm 42. Enclosure of a point to the minimum spanning tree

G. Trybuś

Applicationes Mathematicae (1976)

  • Volume: 15, Issue: 1, page 135-139
  • ISSN: 1233-7234

How to cite

top

G. Trybuś. "Algorithm 42. Enclosure of a point to the minimum spanning tree." Applicationes Mathematicae 15.1 (1976): 135-139. <http://eudml.org/doc/264084>.

@article{G1976,
author = {G. Trybuś},
journal = {Applicationes Mathematicae},
language = {eng},
number = {1},
pages = {135-139},
title = {Algorithm 42. Enclosure of a point to the minimum spanning tree},
url = {http://eudml.org/doc/264084},
volume = {15},
year = {1976},
}

TY - JOUR
AU - G. Trybuś
TI - Algorithm 42. Enclosure of a point to the minimum spanning tree
JO - Applicationes Mathematicae
PY - 1976
VL - 15
IS - 1
SP - 135
EP - 139
LA - eng
UR - http://eudml.org/doc/264084
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.