期刊
DISCRETE MATHEMATICS
卷 233, 期 1-3, 页码 3-36出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0012-365X(00)00224-7
关键词
-
类别
Bor (u) over circle vka presented in 1926 the first solution of the Minimum Spanning Tree Problem (MST) which is generally regarded as a cornerstone of Combinatorial Optimization. In this paper we present the first English translation of both of his pioneering works. This is followed by the survey of development related to the MST problem and by remarks and historical perspective. Out of many available algorithms to solve MST the Bor (u) over circle vka's algorithm is the basis of the fastest known algorithms. (C) 2001 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据