# An efficient algorithm for the maximum distance problem.

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2001)

- Volume: 4, Issue: 2, page 323-350
- ISSN: 1365-8050

## Access Full Article

top## How to cite

topGrün, Gabrielle Assunta. "An efficient algorithm for the maximum distance problem.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 4.2 (2001): 323-350. <http://eudml.org/doc/121932>.

@article{Grün2001,

author = {Grün, Gabrielle Assunta},

journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},

keywords = {graph theory; analysis of algorithms and data structures; maximum distance problem; temporal reasoning},

language = {eng},

number = {2},

pages = {323-350},

publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},

title = {An efficient algorithm for the maximum distance problem.},

url = {http://eudml.org/doc/121932},

volume = {4},

year = {2001},

}

TY - JOUR

AU - Grün, Gabrielle Assunta

TI - An efficient algorithm for the maximum distance problem.

JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

PY - 2001

PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD

VL - 4

IS - 2

SP - 323

EP - 350

LA - eng

KW - graph theory; analysis of algorithms and data structures; maximum distance problem; temporal reasoning

UR - http://eudml.org/doc/121932

ER -

## NotesEmbed ?

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