An efficient algorithm for the maximum distance problem.
Grün, Gabrielle Assunta
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 4 (2001), p. 323-350 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Access to full text
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:121932 
@article{01699530,
     title = {An efficient algorithm for the maximum distance problem.},
     journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
     volume = {4},
     year = {2001},
     pages = {323-350},
     zbl = {0990.68141},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01699530}
}

Grün, Gabrielle Assunta. An efficient algorithm for the maximum distance problem.. Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only], Tome 4 (2001) pp. 323-350. http://gdmltest.u-ga.fr/item/01699530/