Probabilistic analysis of an algorithm for the minimum spanning tree problem with diameter bounded below
Crossref DOI link: https://doi.org/10.1134/S1990478915040043
Published Online: 2015-11-24
Published Print: 2015-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Gimadi, E. Kh.
Shin, E. Yu.
Text and Data Mining valid from 2015-10-01
Version of Record valid from 2015-10-01
Article History
Received: 10 February 2015
Accepted: 4 May 2015
First Online: 24 November 2015