Jaroslav Nesetril, Eva Milková, Helena Nesetrilová  Home/Search
Context Related
| webcache.ms.mff.cuni.cz/~k...s466.ps.gz Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: webcache.ms.mff.cuni.cz/...kamser (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: O. Boruvka 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 survey of the development related to the MST problem and by remarks and historical perspective. Out of many available algorithms to solve MST the Boruvka's algorithm is the basis of the fastest known algorithms. (Update)
Similar documents based on text: More All
0.6: A Few Remarks On The History Of MST-Problem - Nesetril (1997) (Correct)
0.4: An Optimal Minimum Spanning Tree Algorithm - Pettie, Ramachandran (2000) (Correct)
0.3: Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel - Gustedt (1997) (Correct)
BibTeX entry: (Update)
Nesetril, Milkova, and Nesetrilova. Otakar boruvka on minimum spanning tree problem: Translation of both the 1926. http://citeseer.ist.psu.edu/nesetril00otakar.html More
@article{ nesetril01otakar,
author = "Nesetril and Milkova and Nesetrilova",
title = "Otakar Boruvka on Minimum Spanning Tree Problem: Translation of Both the 1926 Papers, Comments, History",
journal = "DMATH: Discrete Mathematics",
volume = "233",
year = "2001",
url = "citeseer.ist.psu.edu/nesetril00otakar.html" }
Citations (may not include all citations):837 Cambridge University Press (context) - Motwani, Raghavan - 1995
717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
97 Trans -- dichotomous algorithms for minimum spanning trees a.. (context) - Fredman, Willard - 1966
53 Applications of path compressions on balanced trees (context) - Tarjan - 1979
47 A randomized linear--time algorithm to find minimum spanning.. - Karger, Klein et al. - 1995
45 Efficient algorithms for finding minimum spanning trees in u.. (context) - Gabov, Galil et al. - 1986
41 the shortest spanning subtree of a graph and the travelling .. (context) - Kruskal - 1956
33 the history of the minimum spanning tree problem (context) - Graham, Hell - 1985
33 Verification and sensitivity analysis of minimum spanning tr.. - Dixon, Rauch et al. - 1992
31 Springer Verlag (context) - Korte, Lov'asz et al. - 1991
27 A randomized linear--time algorithm for finding minimum span.. - Klein, Tarjan - 1994
26 A simpler minimum spanning tree verification algorithm - King - 1993
23 Optimum branchings (context) - Edmonds - 1967
23 A Minimum Spanning Tree Algorithm with Inverse -- Ackerman T.. (context) - Chazelle
21 the abstract properties of linear dependence (context) - Whitney - 1935
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://webcache.ms.mff.cuni.cz/acad/kam/serie/kamser.html): More
Combinatorics Of Mappings (Graph Homomorphisms and Their Use) - Nesetril (2000) (Correct)
A Theory of Pfaffian Orientations I: Perfect Matchings and.. - Galluccio, Loebl (1997) (Correct)
Midsummer Combinatorial Workshop VI - Prague Ju Ly (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC