Concepedia

Otakar Borůvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history

Jaroslav Nešetřil, Eva Milková, Helena Nešetřilová

Discrete Mathematics · 2001 · 304 citations · 13 references

DOIFull text

Open access

Concepts

References

13

Theory of Linear and Integer Programming

Adam N. Letchford, Alexander Schrijver · Journal of the Operational Research Society · 2000 · 5.7K citations

, , +12

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5.1K citations · Full text

, , +11

Discrete-Variable Extremum Problems

George B. Dantzig · Operations Research · 1957 · 913 citations

, , +9

On the History of the Minimum Spanning Tree Problem

Ronald Graham, Pavol Hell · IEEE Annals of the History of Computing · 1985 · 812 citations

, , +8

Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Michael L. Fredman, Dan E. Willard · Journal of Computer and System Sciences · 1994 · 419 citations

, , +14