
Computing euclidean maximum spanning trees
Clyde Monma, Michael Paterson, Subhash Suri, Frances YaoVolume:
5
Langue:
english
Pages:
13
Journal:
Algorithmica
DOI:
10.1007/bf01840396
Date:
June, 1990
Fichier:
PDF, 756 KB
english, 1990