|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2000, Volume 7, Issue 2, Pages 3–11
(Mi da258)
|
|
|
|
This article is cited in 1 scientific paper (total 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
Received: 27.09.1999 Revised: 13.12.1999
Citation:
E. Kh. Gimadi, A. I. Serdyukov, “An algorithm for finding the minimum spanning tree with a diameter bounded from below”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000), 3–11
Linking options:
https://www.mathnet.ru/eng/da258 https://www.mathnet.ru/eng/da/v7/s1/i2/p3
|
Statistics & downloads: |
Abstract page: | 634 | Full-text PDF : | 180 |
|