This article is cited in 1 paper

An algorithm for finding the minimum spanning tree with a diameter bounded from below

E. Kh. Gimadi, A. I. Serdyukov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

UDC: 519.854

Received: 27.09.1999
Revised: 13.12.1999

Bibliographic databases:

• 
•